Asynchronous mappings and asynchronous cellular automata
Information and Computation
On Communicating Finite-State Machines
Journal of the ACM (JACM)
The Book of Traces
Beyond Message Sequence Graphs
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Synthesizing Distributed Finite-State Systems from MSCs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Regular sets of infinite message sequence charts
Information and Computation
Information and Computation
Keeping track of the latest gossip in a distributed system
Distributed Computing
A theory of regular MSC languages
Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Unfolding synthesis of asynchronous automata
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Causal closure for MSC languages
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Weighted asynchronous cellular automata
Theoretical Computer Science
Realizability of Concurrent Recursive Programs
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Distributed Asynchronous Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Optimal Zielonka-type construction of deterministic asynchronous automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Taming distributed asynchronous systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Compositional synthesis of asynchronous automata
Theoretical Computer Science
Note: A quadratic construction for Zielonka automata with acyclic communication structure
Theoretical Computer Science
| Hi-index | 0.00 |
The well-known algorithm of Zielonka describes how to transform automatically a sequential automaton into a deterministic asynchronous trace automaton. In this paper, we improve the construction of deterministic asynchronous automata from finite state automaton. Our construction improves the well-known construction in that the size of the asynchronous automaton is simply exponential in both the size of the sequential automaton and the number of processes. In contrast, Zielonka's algorithm gives an asynchronous automaton that is doubly exponential in the number of processes (and simply exponential in the size of the automaton)