This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
5.7 Bibliographic Notes
B. Bollig. On the expressiveness of asynchronous cellular automata. In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT 2005), volume 3623 of Lecture Notes in Computer Science, pages 528–539, Lübeck, Germany, 2005. Springer.
B. Bollig and M. Leucker. Message-passing automata are expressively equivalent to EMSO logic. Theoretical Computer Science, to appear, 2006. A preliminary version appeared in Proceedings of CONCUR 2004, volume 3170 of Lecture Notes in Computer Science, pages 146–160. Springer, 2004.
M. Droste, P. Gastin, and D. Kuske. Asynchronous cellular automata for pomsets. Theoretical Computer Science, 247(1–2):1–38, 2000.
J. Fanchon and R. Morin. Regular sets of pomsets with autoconcurrency. In 13th International Conference on Concurrency Theory (CONCUR 2002), Brno, Czech Republic, volume 2421 of Lecture Notes in Computer Science, pages 402–417. Springer, 2002.
D. Kuske. Emptiness is decidable for asynchronous cellular machines. In Proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000), University Park, PA, USA, volume 1877 of Lecture Notes in Computer Science, pages 536–551. Springer, 2000.
A. Potthoff, S. Seibert, and W. Thomas. Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bulletin of the Belgian Mathematical Society, 1, 1994.
W. Thomas. Elements of an automata theory over partial orders. In Proceedings of Workshop on Partial Order Methods in Verification (POMIV 1996), volume 29 of DIMACS. AMS, 1996.
W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications, 21:99–135, 1987.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Dags and Asynchronous Cellular Automata. In: Formal Models of Communicating Systems. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32923-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-32923-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32922-0
Online ISBN: 978-3-540-32923-7
eBook Packages: Computer ScienceComputer Science (R0)