Part of the Lecture Notes in Computer Science book series (LNCS, volume 363)
Safe executions of recognizable trace languages by asynchronous automata
KeywordsCellular Automaton Global State Finite Automaton Connection Pattern Deterministic Finite Automaton
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- R.Cori, Y.Metivier, Approximation of a trace, asynchronous automata and the ordering of events in a distributed system, 15 ICALP, LNCS 317,147–161. Springer Verlag, 1988Google Scholar
- R. Cori, Y. Metivier, W. Zielonka, Applications of trace approximation to asynchronous automata and message passing with bounded time-stamps in asynchronous networks, in preparationGoogle Scholar
- C. Duboc, Mixed product and asynchronous automata, Theor. Comp. Sci., 48 (1986),183–199Google Scholar
- S. Eilenberg, Automata, Languages and Machines, vol. A, 1974, Academic PressGoogle Scholar
- Amos Israeli, Ming Li, Bounded Time-Stamps, Proceedings of 28th Annual FOCS Symposium,1987,371–382Google Scholar
- G. Lallement, Semigroups and Combinatorial Applications, 1979, J. Wiley and SonsGoogle Scholar
- A. Mazurkiewicz, Concurrent Program Schemes and Their Interpretations, DAIMI-PB-78, Aarchus University, 1977Google Scholar
- Y. Metivier, An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs, 14 ICALP, LNCS 267Google Scholar
- E. Ochmanski, Regular Behaviour of Concurrent Schemes, EATCS Bulletin, vol. 27,1985,56–67Google Scholar
- W. Zielonka, Notes on Finite Asynchronous Automata, RAIRO Inf. Theor. et Appl., 21 (2), 1987, 99–135Google Scholar
© Springer-Verlag Berlin Heidelberg 1989