Asynchronous cellular automata for pomsets without auto-concurrency

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1119, Issue , 1996, Pages 627-638

  Droste, Manfred ^a   Gastin, Paul ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; MAPPING;

ASYNCHRONOUS CELLULAR AUTOMATON; MONADIC SECOND-ORDER LOGIC; POMSETS;

CELLULAR AUTOMATA;

EID: 0348105751     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_80     Document Type: Conference Paper

References (15)

1. F. Bracho, M. Droste, and D. Kuske. Dependence orders for computations of concurrent automata. In Proceedings of STACS’95, number 900 in Lecture Notes in Computer Science, pages 467-478. Springer Verlag, 1995. Full version to appear in Theoret. Comp. Science.
2. R. Cori, Y. Métivier, and W. Zielonka. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106:159-202, 1993.
3. V. Diekert. A partial trace semantics for petri nets. Theoretical Computer Science, 113:87-105, 1994. Special issue of ICWLC 92, Kyoto (Japan).
4. V. Diekert and A. Muscholl. Construction of asynchronous automata. In G. Rozenberg and V. Diekert, editors, Book of Traces, pages 249-267. World Scientific, Singapore, 1995.
5. V. Diekert and G. Rozenberg, editors. Book of Traces. World Scientific, Singapore, 1995.
6. M. Droste and D. Kuske. Logical definability of recognizable and aperiodic languages in concurrency monoids. In Proceedings of CSL’95, Lecture Notes in Computer Science. Springer Verlag, 1996. to appear.
7. J.L. Gischer. The equational theory of pomsets. Theoretical Computer Science, 61:199-224, 1988.
8. A. Mazurkiewicz. Concurrent program schemes and their interpretations. Tech. rep. DAIMI PB 78, Aarhus University, 1977.
9. A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Advances in Petri Nets’86, number 255 in Lecture Notes in Computer Science, pages 279-324. Springer Verlag, 1987.
10. A. Muscholl. On the complementation of Büchi asynchronous cellular automata. In S. Abiteboul and E. Shamir, editors, Proceedings of the 21st International Colloquium on Automata, Languages and Programming (ICALP’94), number 820 in Lecture Notes in Computer Science. Springer Verlag, 1994.
11. V.R. Pratt. Modelling concurrency with partial orders. J. of Parallel Programming, 15:33-71, 1987.
12. P.H. Starke. Processes in petri nets. EIK, 17:389-416, 1981.
13. Wolfgang Thomas. On logical definability of trace languages. In V. Diekert, editor, Proceedings of a workshop of the ESPRIT BRA No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS), 1989, Report TUM-I9002, Technical University of Munich, pages 172-182, 1990.
14. W. Zielonka. Notes on firfite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications, 21:99-135, 1987.
15. W. Zielonka. Safe executions of recognizable trace languages by asynchronous automata. In A. R. Meyer et al., editors, Proceedings of the Symposium on Logical Foundations of Computer Science (Logic at Botik’89), number 363 in Lecture Notes in Computer Science, pages 278-289. Springer Verlag, 1989.