223 search results - page 28 / 45 » Synchronization of Pushdown Automata |
ICALP
2010
Springer
14 years 10 days ago
2010
Springer
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
ECAL
1999
Springer
13 years 11 months ago
1999
Springer
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are per...
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...