Abstract
We present a subset automaton construction for asynchronous cellular automata. This provides an answer to the problem of direct determinization for asynchronous cellular automata for finite traces, which has been open for several years. We use the subset automaton construction in order to extend Klarlund's progress measure technique of complementation to non-deterministic asynchronous cellular Büchi automata for infinite traces. Our automaton for the complement (as well as the subset automaton) has \(2^{O(N^{\left| \Sigma \right|} )} \) global states.
Research supported by the ESPRIT Basic Research Action No. 6317 (ASMICS 2).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Number 85 in Lecture Notes in Mathematics. Springer, 1969.
R. Cori and Y. Métivier. Approximation of a trace, asynchronous automata and the ordering of events in a distributed system. In Proc. of the 15th ICALP, LNCS 317, pp. 147–161. 1988.
R. Cori, Y. Métivier, and W. Zielonka. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106:159–202, 1993.
V. Diekert and W. Ebinger, eds. Infinite Traces. Proc. of a workshop of the ESPRIT BRA No 3166 (ASMICS), Tübingen, 1992, Ber. 4/92. Univ. Stuttgart.
V. Diekert. Combinatorics on Traces. No. 454 in LNCS. Springer, 1990.
V. Diekert and A. Muscholl. Deterministic asynchronous automata for infinite traces. In Proc. of the 10th STACS, LNCS 665, pp. 617–628, 1993.
P. Gastin. Recognizable and rational trace languages of finite and infinite traces. In Proc. of the 8th STACS, LNCS 480, pp. 89–104, 1991.
P. Gastin and A. Petit. Asynchronous automata for infinite traces. In Proc. of the 19th ICALP, LNCS 623, pp. 583–594, 1992.
N. Klarlund. Progress measures for complementation of ω-automata with applications to temporal logic. In Proc. of the 32nd FOCS, Oct. 1–4, 1991, San Juan, Puerto Rico, pp. 358–367, 1991.
N. Klarlund, M. Mukund, and M. Sohoni. Determinizing asynchronous automata. This volume.
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
J.-P. Pécuchet. On the complementation of Büchi automata. Theor. Comp. Sci., (47):95–98, 1986.
G. Pighizzini. Personal communication, 1993.
G. Pighizzini. Recognizable trace languages and asynchronous automata. PhD thesis, Dip. Scienze dell'Informazione, Università di Milano, 1993.
S. Safra. On the complexity of ω-automata. In Proc. of the 29th FOCS, 1988.
W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications, 21:99–135, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muscholl, A. (1994). On the complementation of Büchi asynchronous cellular automata. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_64
Download citation
DOI: https://doi.org/10.1007/3-540-58201-0_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58201-4
Online ISBN: 978-3-540-48566-7
eBook Packages: Springer Book Archive