Communities of Interacting Automata for Modelling Distributed Systems with Dynamic Structure

Authors:
Irina A. Lomazowa
Affiliations:
Moscow State Social University, Moscow, 107150, Program Systems Institute of Russian Academy of Science, Pereslavl-Zalessky, 152020, Russia
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Year:
2003

Citing 8
Cited 2

Petri nets: an introduction

Petri nets: an introduction
Reduction and covering of infinite reachability trees

Information and Computation
Process rewrite systems

Information and Computation - Special issue on EXPRESS 1997
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)
On context-free parallel communicating grammar systems: synchronization, communication, and normal forms

Theoretical Computer Science
Well-structured transition systems everywhere!

Theoretical Computer Science
Dynamic hierarchical machines

Fundamenta Informaticae - Concurrency specification and programming
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

A Hierarchical Methodology to Specify and Simulate Complex Computational Systems

ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Interacting Workflow Nets for Workflow Process Re-Engineering

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

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