Interacting automata for modelling distributed systems

Authors:
Irina A. Lomazova
Affiliations:
Program Systems Institute of the Russian Academy of Science, Russia
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Year:
2003

Citing 5
Cited 0

Petri nets: an introduction

Petri nets: an introduction
Language theory of Petri nets

Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Reduction and covering of infinite reachability trees

Information and Computation
Nested petri nets - a formalism for specification and verification of multi-agent distributed systems

Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Well-structured transition systems everywhere!

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.