2003
DOI: 10.1007/3-540-44862-4_92
|View full text |Cite
|
Sign up to set email alerts
|

Interacting Automata for Modelling Distributed Systems

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2009
2009

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Even though there are general purpose formalisms to formally describe complex concurrent systems (such as Process Algebras and Petri Nets) they are not suitable to describe agents since these languages and notations do not provide specific operators to deal with the inherent characteristics of agents. However, there has been already several studies to formally describe the use of intelligent electronic agents that are nested into one another (see, for example, [2,3] for two approaches based on Petri Nets and automata, [4,5] for approaches based on process algebras, and [6,7] for approaches based on finite state machines). Most of these approaches have been created in favor of comprehensibility.…”
Section: Introductionmentioning
confidence: 99%
“…Even though there are general purpose formalisms to formally describe complex concurrent systems (such as Process Algebras and Petri Nets) they are not suitable to describe agents since these languages and notations do not provide specific operators to deal with the inherent characteristics of agents. However, there has been already several studies to formally describe the use of intelligent electronic agents that are nested into one another (see, for example, [2,3] for two approaches based on Petri Nets and automata, [4,5] for approaches based on process algebras, and [6,7] for approaches based on finite state machines). Most of these approaches have been created in favor of comprehensibility.…”
Section: Introductionmentioning
confidence: 99%