2632 search results - page 168 / 527 » Alternating Timed Automata |
189
click to vote
FOSSACS
2007
Springer
16 years 22 days ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
188
click to vote
MFCS
2007
Springer
16 years 21 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
156
click to vote
NETCOOP
2007
Springer
16 years 21 days ago
2007
Springer
Recently Gerald Ash has shown through case studies that event dependent routing is attractive in large scale multi-service MPLS networks. In this paper, we consider the application...
190
click to vote
ICSEA
2006
IEEE
16 years 18 days ago
2006
IEEE
— This paper describes an innovative approach to network testing based on automatically generating and analyzing state machine models of network behavior. The models are generate...
148
click to vote
TACAS
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...