Asynchronous cellular automata and asynchronous automata for pomsets

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

Volumn 1466, Issue , 1998, Pages 517-532

  Kuske, Dietrich ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR AUTOMATA; COMPUTER CIRCUITS;

ASYNCHRONOUS AUTOMATA; ASYNCHRONOUS CELLULAR AUTOMATON; EXPRESSIVE POWER; MAZURKIEWICZ TRACES; MONADIC SECOND-ORDER LOGIC; POMSETS;

ROBOTS;

EID: 22044450035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055645     Document Type: Conference Paper

References (16)

1. V. Diekert, A. Muscholl: Construction of asynchronous automata. Chapter 8 [3]
2. M. Droste, P. Gastin: Asynchronous cellular automata and logic for pomsets without auto-concurrency. To appear, 1997. Extended abstract appeared as Asynchronous cellular automata for pomsets without auto-concurrency. In: CONCUR 90. Lecture Notes in Computer Science 1119, pp. 627-638, 1996.
3. V. Diekert, G. Rozenberg (eds.): The Book of Traces. World Scientific, Singapore, 1995.
4. L.L. Gisclier: The cquational theory of pomsets. Theoretical Computer Science Gl (1988), pp. 199-224.
5. N. Klarlund, M. Mukund, M. A. Sohoni: Determinizing asynchronous automata. In: ICALP’94 (S. Abiteboul, E. Shamir, eds.), Lecture Notes in Computer Science 820, pp. 130-141, 1994.
6. D. Kuske: Acceptance modes for asynchronous cellular automata for pomsets. http://www.math.tu-dresden.de/kuske/abstracts/aca.html, 1997.
7. A. Mazurkiewicz: Concurrent program schemes and their interpretation. Tech. rep. DA1MI PB 78, Aarhus University, 1977.
8. A. Mazurkiewicz: Trace Theory. In: Advances in Petri Nets 86 (W. Brauer et al., eds.), Lecture Notes in Computer Science 255, pp. 279-324, 1987.
9. O. Matz, W. Thomas: The monadic quantifier alternation hierarchy over graphs is infinite. In: Proc. LICS 1997, pp. 236-244.
10. V.R. Pratt: Modelling concurrency with partial orders. J. of Parallel Programming 15 (1987), pp. 33-71.
11. W. Thomas: On logical definability of trace languages. In: Proc. of the workshop Algebraic Methods in Computer Science, Kochel am See, FRG (1989) (V. Diekert, ed.). Report TUM-I9002, TU Munich, 1990, pp. 172-182.
12. W. Thomas: Languages, Automata, and Logic. In: Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.) Springer Verlag (to appeal). For a preliminary version see: Rep. 9607, Inst. f. Informatik u. Prakt. Math., Universität Kiel, 1996.
13. W. Thomas: Automata theory on trees and partial orders. In: TAPSOFT 97 (M. Bidoit, M. Dauchet, eds.), Lecture Notes in Computer Science 1214, pp. 20-38, 1997.
14. W. Zielonka: Notes on finite asynchronous automata. R.A.I.R.O. - Informatique Théorique et Applications 21 (1987), pp. 99-135.
15. W. Zielonka: Safe executions of recognizable trace languages by asynchronous automata. In: Logical Foundations of Computer Science (A.R. Meyer et al., eds.), Lecture Notes in Computer Science 363, pp. 278-289, 1989.
16. W. Zielonka: Asynchronous automata. Chapter 7 of [3].