Communities of Interacting Automata for Modelling Distributed Systems with Dynamic Structure

• Autorzy: Lomazova I.A.
• Języki publikacji: EN

Abstrakty

EN

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 nonlimited number of distributed agents. We show that the formalism of interacting automata has a clear semantics and nice semantic properties.

Słowa kluczowe

EN

distributed systems; finite automata; interaction; semantical properties; systems with dynamc structure

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2004
• Tom: Vol. 60, nr 1-4
• Strony: 225--235
• Opis fizyczny: Bibliogr. 13 poz.

Twórcy

autor

Lomazova I.A.

• Moscow State Social University, Moscow, 107150, Program Systems Institute of Russian Academy of Science, Pereslavl-Zalessky, 152020, Russia,

Bibliografia

• [1l Alur. R., Kannan. S. and Yannakakis, M.: Communicating Hierarchical Automata. Lecture Notes in Computer Science, 1644. 1999, 169-178.
• [2] Chuhaj-Varjú E., Vaszil G.: On Context-Free Parallel Communicating Grammar Systems: Synchronization. Communication, and Normal Forms. Theoretical Computer Science. 255, 2001, 511-538.
• [3] Finkel A.: Reduction and covering of infinite reachability trees. Information and Computation. 89(2), 1990, 144-179.
• [4] Finkel A., Schnoebelen Ph.: Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2), 2001, 63-92.
• [5] Hopcroft. J. E., Motwani. R., and Ullman, J. D.: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publ. Co., 2001.
• [6] Jantzen M.: Language Theory of Petri Nets, Lecture Notes in Computer Science. 254. 1987.
• [7] Lanotte R., Maggiolo-Schettini A., Peron A., Tini S.: Dynamic Hierarchical Machines. Fundamenta Informaticae, 54(2-3), 2003, 237-252.
• [8] Lomazova, I.A.: Nested Petri nets-a Formalism for Specification and Verification of Multi-Agent Distributed Systems, Fundamenta Informaticae, 43( 1-4), 2000, 195-214.
• [9] Mayr, E. W.: An Algorithm for the General Petri Net Reachability Problem, SIAM Journal on Computing, 13, 1984,441-460.
• [10] Mayr, R.: Process Rewrite Systems, Information and Computation, 156(1). 2000, 264-286.
• [11] Reisig W.: Petri nets. An Introduction. Springer-Verlag, 1985.
• [12] Trakhtenbrot. B. A.: Automata. Circuits, and Hybrids: Jacets of Continuous Time, Lecture Notes in Computer Science, 2076. 2001, 4-23.
• [13] Yannakakis, M.:Hierarchical State Machines. Lecture Notes in Computer Science, 1875. 2000, 315-330.