371 search results - page 20 / 75 » Pushdown Automata Simulator |
78
Voted
MFCS
1994
Springer
15 years 6 months ago
1994
Springer
We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape befor...
120
Voted
ICALP
1997
Springer
15 years 5 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
104
Voted
ENTCS
2006
15 years 1 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
132
click to vote
WOLLIC
2010
Springer
15 years 5 days ago
2010
Springer
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...
149
click to vote
HYBRID
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...