Abstract
In a multi-agent system, how agents accomplish a goal task is usually specified by multi-agent plans built from basic actions (e.g. operators) of which the agents are capable. A critical problem with such an approach is how can the designer make sure the plans are reliable. To tackle this problem, this paper presents a formal approach for modeling and analyzing multi-agent behaviors using Predicate/Transition (PrT) nets, a high-level formalism of Petri nets. We construct a multi-agent model by representing agent capabilities as transitions. To verify a multi-agent PrT model, we adapt the planning graphs as a compact structure for the reachability analysis. We also demonstrate that, based on the PrT model, whether parallel actions specified in multi-agent plans can be executed in parallel and whether the plans guarantee the achievement of the goal can be verified by analyzing the dependency relations among the transitions.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02 |
| Pages | 193-200 |
| Number of pages | 8 |
| DOIs | |
| State | Published - Dec 1 2002 |
| Event | 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02 - Ischia, Italy Duration: Jul 15 2002 → Jul 19 2002 |
Publication series
| Name | ACM International Conference Proceeding Series |
|---|---|
| Volume | 27 |
Other
| Other | 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02 |
|---|---|
| Country | Italy |
| City | Ischia |
| Period | 7/15/02 → 7/19/02 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Human-Computer Interaction
- Computer Vision and Pattern Recognition
- Computer Networks and Communications
Cite this
}
Modeling and verifying multi-agent behaviors using predicate/transition nets. / Xu, Dianxiang; Volz, Richard; Ioerger, Thomas; Yen, John.
Proceedings of the 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02. 2002. p. 193-200 (ACM International Conference Proceeding Series; Vol. 27).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Modeling and verifying multi-agent behaviors using predicate/transition nets
AU - Xu, Dianxiang
AU - Volz, Richard
AU - Ioerger, Thomas
AU - Yen, John
PY - 2002/12/1
Y1 - 2002/12/1
N2 - In a multi-agent system, how agents accomplish a goal task is usually specified by multi-agent plans built from basic actions (e.g. operators) of which the agents are capable. A critical problem with such an approach is how can the designer make sure the plans are reliable. To tackle this problem, this paper presents a formal approach for modeling and analyzing multi-agent behaviors using Predicate/Transition (PrT) nets, a high-level formalism of Petri nets. We construct a multi-agent model by representing agent capabilities as transitions. To verify a multi-agent PrT model, we adapt the planning graphs as a compact structure for the reachability analysis. We also demonstrate that, based on the PrT model, whether parallel actions specified in multi-agent plans can be executed in parallel and whether the plans guarantee the achievement of the goal can be verified by analyzing the dependency relations among the transitions.
AB - In a multi-agent system, how agents accomplish a goal task is usually specified by multi-agent plans built from basic actions (e.g. operators) of which the agents are capable. A critical problem with such an approach is how can the designer make sure the plans are reliable. To tackle this problem, this paper presents a formal approach for modeling and analyzing multi-agent behaviors using Predicate/Transition (PrT) nets, a high-level formalism of Petri nets. We construct a multi-agent model by representing agent capabilities as transitions. To verify a multi-agent PrT model, we adapt the planning graphs as a compact structure for the reachability analysis. We also demonstrate that, based on the PrT model, whether parallel actions specified in multi-agent plans can be executed in parallel and whether the plans guarantee the achievement of the goal can be verified by analyzing the dependency relations among the transitions.
UR - http://www.scopus.com/inward/record.url?scp=77953729901&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77953729901&partnerID=8YFLogxK
U2 - 10.1145/568760.568794
DO - 10.1145/568760.568794
M3 - Conference contribution
AN - SCOPUS:77953729901
SN - 1581135564
SN - 9781581135565
T3 - ACM International Conference Proceeding Series
SP - 193
EP - 200
BT - Proceedings of the 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02
ER -