Abstract
A community of interacting automata is a set of nondeterministic finite automata which can execute actions autonomously, synchronize with each other, or generate new members of the community. Thus interacting automata allow to model distributed systems with unlimited number of interacting agents. We show that the formalism of interacting automata has a clear semantics and nice semantic properties, leading to decidability of some important behavioral properties of modelled systems.
This work was partly supported by the Presidium of the Russian Academy of Science, program “Intellectual computer systems”, project 2.3 - “Instrumental software for dynamic intellectual systems” and INTAS-RFBR (Grant 01-01-04003).
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
R. Alur, S. Kannan, and M. Yannakakis. Communicating Hierarchical Automata. In ICALP’99, volume 1644 of Lecture Notes in Computer Science, pages 169–178. Springer, 1999.
A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144–179, 1990.
A. Finkel, and Ph. Schnoebelen. Well-structured transition systems everywhere!Theoretical Computer Science, 256:1–2, pages 63–92, 2001.
M. Jantzen. Language Theory of Petri Nets. In Petri nets: Central Models and their Properties, volume 254 of Lecture Notes in Computer Science, pages 397–412. Springer, 1987.
R. Lanotte, A. M. Schettini, A. Peron, S. Tini. Dynamic Hierarchical Machines. In Proc. of the Concurrency Specification and Programming (CS&P’2000) Workshop. 7–9 October 2002. Vol.2, Informatik-Bericht Nr.161, Humboldt-Universitat zu Berlin, pages 205–216, 2002.
I. A. Lomazova. Nested Petri nets — a Formalism for Specification and Verification of Multi-Agent Distributed Systems. Fundamenta Informaticae, 43(1–4): 195–214, 2000.
E. W. Mayr. An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing, 13:441–460, 1984.
W. Reisig. Petri Nets. An Introduction, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer, 1985.
B.A. Trakhtenbrot. Automata, Ciruits, and Hybrids: Facets of Continious Time. volume 2076 of Lecture Notes in Computer Science, pages 4–23. Springer, 2001.
M. Yannakakis. Hierarchical State Machines. In IFIP Theoretical Computer Science’2000, volume 1875 of Lecture Notes in Computer Science, pages 315–330. Springer, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lomazova, I.A. (2003). Interacting Automata for Modelling Distributed Systems. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44862-4_92
Download citation
DOI: https://doi.org/10.1007/3-540-44862-4_92
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40195-7
Online ISBN: 978-3-540-44862-4
eBook Packages: Springer Book Archive