Petri nets: an introduction
Reduction and covering of infinite reachability trees
Information and Computation
Information and Computation - Special issue on EXPRESS 1997
Theoretical Computer Science
Well-structured transition systems everywhere!
Theoretical Computer Science
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Communicating Hierarchical State Machines
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Automata, Circuits, and Hybrids: Facets of Continuous Time
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Hi-index | 0.00 |
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.