Modeling concurrency with partial orders
International Journal of Parallel Programming
The equational theory of pomsets
Theoretical Computer Science
Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Asynchronous cellular automata for promsets
Theoretical Computer Science
The Book of Traces
Asynchronous Cellular Automata for Infinite Traces
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Asynchronous Cellular Automata for Pomsets Without Auto-concurrency
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Evolution of Asynchronous Cellular Automata
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Weighted Distributed Systems and Their Logics
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
On the expressiveness of asynchronous cellular automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We resume the investigation of asynchronous cellular automata. Originally, these devices were considered in the context of Mazurkiewicz traces, and later generalized to run on arbitrary pomsets without autoconcurrency by Droste and Gastin [3]. While the universality of the accepted language is known to be undecidable [11], we show here that the emptiness is decidable. Our proof relies on a result due to Finkel and Schnoebelen [7] on well-structured transition systems.