2006
DOI: 10.1007/11758532_25
|View full text |Cite
|
Sign up to set email alerts
|

Modelling, Analyzing and Control of Interactions Among Agents in MAS

Abstract: Abstract. An alternative approach to modelling and analysis of interactions among agents in multiagent systems (MAS) and their control is presented in analytical terms. The reachability graph of the Petri net (PN)-based model of MAS is found as well as the space of feasible states. Trajectories representing the interaction processes among agents in MAS are computed by means of the mutual intersection of both the straightlined reachability tree (from a given initial state towards the terminal one) and the backt… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2008
2008
2011
2011

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(11 citation statements)
references
References 11 publications
0
11
0
Order By: Relevance
“…On that way the earlier results concerning the agents cooperation based on supervision presented in [2,3,4,5,6] can be utilized as well as the theory of supervision [11,12,13]. However, the agent negotiation based on P/T PN [7] seems to be more sophisticated.…”
Section: First Order Hybrid Petri Nets (Fohpn)mentioning
confidence: 99%
See 1 more Smart Citation
“…On that way the earlier results concerning the agents cooperation based on supervision presented in [2,3,4,5,6] can be utilized as well as the theory of supervision [11,12,13]. However, the agent negotiation based on P/T PN [7] seems to be more sophisticated.…”
Section: First Order Hybrid Petri Nets (Fohpn)mentioning
confidence: 99%
“…6, both agents and the interface are modules of P/T PN (PN subnets). Thus, the agent negotiation can be modelled in analytical term (2). The P/T PN based model of the agents communication has the following parameters …”
Section: The Negotiation Of Two Agentsmentioning
confidence: 99%
“…Its nodes are the states reachable from the initial state x 0 and its edges are weighted by corresponding PN transitions enabling the state-to-state transit. The control synthesis based on RG is described in the author's works [3,5]. Consequently, this problem is not discussed here.…”
Section: The Illustrative Examplementioning
confidence: 99%
“…The second step, from p 1 to p 2 , results in the shared token in the place p 13 , as described above. The third step brings A 1 to p 3 , with action expressed by the transition t 5 that it is presently not interested in going critical, or with action represented by the transition t 4 in case A 2 more recently executed the step from p 7 to p 8 .…”
Section: The Counter-examplementioning
confidence: 99%
See 1 more Smart Citation