Modeling and verifying multi-agent behaviors using predicate/transition nets

Dianxiang Xu, Richard Volz, Thomas Ioerger, John Yen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationProceedings of the 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02
Pages193-200
Number of pages8
DOIs
StatePublished - Dec 1 2002
Event14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02 - Ischia, Italy
Duration: Jul 15 2002Jul 19 2002

Publication series

NameACM International Conference Proceeding Series
Volume27

Other

Other14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02
CountryItaly
CityIschia
Period7/15/027/19/02

Fingerprint

Petri nets
Multi agent systems
Planning

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Cite this

Xu, D., Volz, R., Ioerger, T., & Yen, J. (2002). Modeling and verifying multi-agent behaviors using predicate/transition nets. In Proceedings of the 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02 (pp. 193-200). (ACM International Conference Proceeding Series; Vol. 27). https://doi.org/10.1145/568760.568794
Xu, Dianxiang ; Volz, Richard ; Ioerger, Thomas ; Yen, John. / Modeling and verifying multi-agent behaviors using predicate/transition nets. Proceedings of the 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02. 2002. pp. 193-200 (ACM International Conference Proceeding Series).
@inproceedings{a3fbed760d054bee8a07424b388158e2,
title = "Modeling and verifying multi-agent behaviors using predicate/transition nets",
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.",
author = "Dianxiang Xu and Richard Volz and Thomas Ioerger and John Yen",
year = "2002",
month = "12",
day = "1",
doi = "10.1145/568760.568794",
language = "English (US)",
isbn = "1581135564",
series = "ACM International Conference Proceeding Series",
pages = "193--200",
booktitle = "Proceedings of the 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02",

}

Xu, D, Volz, R, Ioerger, T & Yen, J 2002, Modeling and verifying multi-agent behaviors using predicate/transition nets. in Proceedings of the 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02. ACM International Conference Proceeding Series, vol. 27, pp. 193-200, 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02, Ischia, Italy, 7/15/02. https://doi.org/10.1145/568760.568794

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 proceedingConference 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 -

Xu D, Volz R, Ioerger T, Yen J. Modeling and verifying multi-agent behaviors using predicate/transition nets. In Proceedings of the 14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02. 2002. p. 193-200. (ACM International Conference Proceeding Series). https://doi.org/10.1145/568760.568794