Asynchronous cellular automata for pomsets

Theoretical Computer Science

Volumn 247, Issue 1-2, 2000, Pages 1-38

  Droste, Manfred ^a   Gastin, Paul ^b   Kuske, Dietrich ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Automata theory; Concurrency; Monadic second order logic; Partial orders

Indexed keywords

EID: 0344792817     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00166-3     Document Type: Article

References (21)

1. A. Arnold, An extension of the notions of traces and of asynchronous automata, Inform. Théorique Appl. 25 (1991) 355-393.
2. R. Cori, Y. Métivier, W. Zielonka, Asynchronous mappings and asynchronous cellular automata, Inform. and Comput. 106 (1993) 159-202.
3. M. Droste, P. Gastin, Asynchronous cellular automata for pomsets without autoconcurrency, CONCUR'96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin 1996, pp. 627-638.
4. V. Diekert, A partial trace semantics for Petri nets, Theoret. Comput. Sci. 134 (1994) 87-105.
5. V. Diekert, A. Muscholl, Construction of asynchronous automata, The Book of Traces, World Scientific Publ. Co., Singapore, 1995, pp. 249-267.
6. V. Diekert, G. Rozenberg, The Book of Traces, World Scientific Publ. Co., Singapore, 1995.
7. S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, New York, 1974.
8. J.L. Gischer, The equational theory of pomsets, Theoret. Comput. Sci. 61 (1988) 199-224.
9. D. Kuske, Asynchronous cellular automata and asynchronous automata for pomsets CONCUR'98, Lecture Notes in Computer Science, vol. 1466, Springer, Berlin, 1998, pp. 517-532.
10. D. Kuske, Contributions to a trace theory beyond Mazurkiewicz traces, Manuscript, 1999.
11. K. Lodaya, P. Weil, A Kleene iteration for parallelism, in: V. Arvind, R. Ramanujam (Eds.), FST and TCS 98, Lecture Notes in Computer Science, vol. 1530, Springer, Berlin, 1998, pp. 355-366.
12. K. Lodaya, P. Weil, Series-parallel posets: algebra, automata and languages, in: M. Morvan, Ch. Meinel, D. Krob (Eds.), STACS98, Lecture Notes in Computer Science, vol. 1373, Springer, Berlin, 1998, pp. 555-565.
13. K. Lodaya, P. Weil, Series-parallel languages and the bounded-width property, Theoretical Comput. Sci. 237 (2000) 347-380.
14. A. Mazurkiewicz, Concurrent program schemes and their interpretation, Tech. Rep. DAIMI Report PB-78, Aarhus University, 1977.
15. A. Mazurkiewics, Trace theory, Advanced Course on Petri Nets, Lecture Notes in Computer Science, Springer, Berlin, 1986, pp. 279-324.
16. A. Muscholl, Über die Erkennbarkeit unendlicher Spuren, Teubner, Stuttgart, 1996.
17. V. Pratt, Modelling concurrency with partial orders, Internat. J. Parallel Programming 15 (1986) 33-71.
18. P.H. Starke, Processes in Petri nets, Elektron. Inform. Kybernet. 17 (1981) 389-416.
19. W. Thomas, On logical definability of trace languages, in: V. Diekert (Ed.), Proc. workshop of the ESPRIT BRA No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS) 1989, Report TUM-19002, Technical University of Munich, 1990, pp. 172-182.
20. W. Zielonka, Notes on finite asynchronous automata, R.A.I.R.O. - Inform. Théorique Appl. 21 (1987) 99-135.
21. W. Zielonka, Safe executions of recognizable trace languages by asynchronous automata, in: A.R. Meyer, et al., (Eds.), Logical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 363, Springer, Berlin, 1989, pp. 278-289.