research-article

Modular interpreted systems

Authors:

Wojciech Jamroga,

Thomas ÅgotnesAuthors Info & Claims

AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

Article No.: 131, Pages 1 - 8

https://doi.org/10.1145/1329125.1329286

Published: 14 May 2007 Publication History

Abstract

We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representations borrow the main ideas from interpreted systems of Halpern, Fagin et al.; however, they are also modular and compact in the way concurrent programs are. We also mention preliminary results on model checking alternating-time temporal logic for this natural class of models.

References

[1]

R. Alur and T. A. Henzinger. Reactive modules. Formal Methods in System Design, 15(1):7--48, 1999.

Digital Library

[2]

R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time Temporal Logic. Lecture Notes in Computer Science, 1536:23--60, 1998.

Digital Library

[3]

R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time Temporal Logic. Journal of the ACM, 49:672--713, 2002.

Digital Library

[4]

R. Alur, T. A. Henzinger, F. Y. C. Mang, S. Qadeer, S. K. Rajamani, and S. Tasiran. MOCHA user manual. In Proceedings of CAV'98, volume 1427 of Lecture Notes in Computer Science, pages 521--525, 1998.

Digital Library

[5]

E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244--263, 1986.

Digital Library

[6]

E. A. Emerson and J. Y. Halpern. "sometimes" and "not never" revisited: On branching versus linear time temporal logic. In Proceedings of the Annual ACM Symposium on Principles of Programming Languages, pages 151--178, 1982.

Digital Library

[7]

R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press: Cambridge, MA, 1995.

Digital Library

[8]

M. Franceschet, A. Montanari, and M. de Rijke. Model checking for combined logics. In Proceedings of the 3rd International Conference on Temporal Logic (ICTL), 2000.

[9]

V. Goranko and W. Jamroga. Comparing semantics of logics for multiagent systems. Synthese, 139(2):241--280, 2004.

[10]

J. Y. Halpern. Reasoning about knowledge: a survey. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, The Handbook of Logic in Artificial Intelligence and Logic Programming, Volume IV, pages 1--34. Oxford University Press, 1995.

Digital Library

[11]

J. Y. Halpern and R. Fagin. Modelling knowledge and action in distributed systems. Distributed Computing, 3(4):159--177, 1989.

Digital Library

[12]

W. Jamroga and J. Dix. Do agents make model checking explode (computationally)? In M. Pěchouček, P. Petta, and L. Z. Varga, editors, Proceedings of CEEMAS 2005, volume 3690 of Lecture Notes in Computer Science, pages 398--407. Springer Verlag, 2005.

Digital Library

[13]

W. Jamroga and J. Dix. Model checking abilities of agents: A closer look. Submitted, 2006.

[14]

W. Jamroga and T. Ågotnes. Modular interpreted systems: A preliminary report. Technical Report IfI-06-15, Clausthal University of Technology, 2006.

[15]

O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312--360, 2000.

Digital Library

[16]

F. Laroussinie, N. Markey, and G. Oreiby. Expressiveness and complexity of ATL. Technical Report LSV-06-03, CNRS & ENS Cachan, France, 2006.

[17]

K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.

Digital Library

[18]

K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proceedings of CAV'02, volume 2404 of Lecture Notes in Computer Science, pages 250--264, 2002.

Digital Library

[19]

W. Penczek and A. Lomuscio. Verifying epistemic properties of multiagent systems via bounded model checking. In Proceedings of AAMAS'03, pages 209--216, New York, NY, USA, 2003. ACM Press.

Digital Library

[20]

F. Raimondi and A. Lomuscio. The complexity of symbolic model checking temporal-epistemic logics. In L. Czaja, editor, Proceedings of CS&P'05, 2005.

[21]

P. Y. Schobbens. Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science, 85(2), 2004.

[22]

W. van der Hoek, A. Lomuscio, and M. Wooldridge. On the complexity of practical ATL model checking. In P. Stone and G. Weiss, editors, Proceedings of AAMAS'06, pages 201--208, 2006.

Digital Library

Cited By

De Masellis RGoranko V(2020)Logic-based specification and verification of homogeneous dynamic multi-agent systemsAutonomous Agents and Multi-Agent Systems10.1007/s10458-020-09457-834:2Online publication date: 28-Apr-2020
https://doi.org/10.1007/s10458-020-09457-8
Condurache RDe Masellis RGoranko V(2019)Dynamic Multi-Agent Systems: Conceptual Framework, Automata-Based Modelling and VerificationPRIMA 2019: Principles and Practice of Multi-Agent Systems10.1007/978-3-030-33792-6_7(106-122)Online publication date: 21-Oct-2019
https://doi.org/10.1007/978-3-030-33792-6_7
Belardinelli FGrandi UHerzig ALongin DLorini ENovaro APerrussel L(2017)Relaxing Exclusive Control in Boolean GamesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.251.4251(43-56)Online publication date: 25-Jul-2017
https://doi.org/10.4204/EPTCS.251.4
Show More Cited By

Index Terms

Modular interpreted systems
1. Computing methodologies
  1. Artificial intelligence
    1. Distributed artificial intelligence
      1. Multi-agent systems
2. Theory of computation
  1. Logic
    1. Modal and temporal logics

Recommendations

Abstraction for model checking modular interpreted systems over ATL
AAMAS '11: The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3

We propose an abstraction technique for model checking multi-agent systems given as modular interpreted systems (MIS) which allow for succinct representations of compositional systems. Specifications are given as arbitrary ATL formulae, i. e., we can ...
Towards model checking interpreted systems
AAMAS '03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems

We show how it is possible to pair the NuSMV model checker with Akka, a software platform used to check validity of propositional modal formulas, to verify static properties of multi-agent systems formalised on interpreted systems semantics.
Abstraction for model checking modular interpreted systems over ATL
ProMAS'11: Proceedings of the 9th international conference on Programming Multi-Agent Systems

We present an abstraction technique for model checking multi-agent systems given as modular interpreted systems ($\textsc{MIS}$) (introduced by Jamroga and Ågotnes). $\textsc{MIS}$ allow for succinct representations of compositional systems, they permit ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

May 2007

1585 pages

ISBN:9788190426275

DOI:10.1145/1329125

Conference Chairs:
Edmund Durfee
University of Michigan
,
Makoto Yokoo
Kyushu University
,
Program Chairs:
Michael Huhns
University of South Carolina
,
Onn Shehory
IBM Haifa Research Lab, Israel

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

IFAAMAS

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 May 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Norges Forskningsråd

Conference

AAMAS07

Sponsor:

AAMAS07: International Conference on Autonomous Agents and Mulitagent Systems

May 14 - 18, 2007

Hawaii, Honolulu

Acceptance Rates

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
166
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

De Masellis RGoranko V(2020)Logic-based specification and verification of homogeneous dynamic multi-agent systemsAutonomous Agents and Multi-Agent Systems10.1007/s10458-020-09457-834:2Online publication date: 28-Apr-2020
https://doi.org/10.1007/s10458-020-09457-8
Condurache RDe Masellis RGoranko V(2019)Dynamic Multi-Agent Systems: Conceptual Framework, Automata-Based Modelling and VerificationPRIMA 2019: Principles and Practice of Multi-Agent Systems10.1007/978-3-030-33792-6_7(106-122)Online publication date: 21-Oct-2019
https://doi.org/10.1007/978-3-030-33792-6_7
Belardinelli FGrandi UHerzig ALongin DLorini ENovaro APerrussel L(2017)Relaxing Exclusive Control in Boolean GamesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.251.4251(43-56)Online publication date: 25-Jul-2017
https://doi.org/10.4204/EPTCS.251.4
Belardinelli FLomuscio A(2016)Abstraction-based verification of infinite-state reactive modulesProceedings of the Twenty-second European Conference on Artificial Intelligence10.3233/978-1-61499-672-9-725(725-733)Online publication date: 29-Aug-2016
https://dl.acm.org/doi/10.3233/978-1-61499-672-9-725
Huang XChen QSu K(2015)The complexity of model checking succinct multiagent systemsProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832249.2832398(1076-1082)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832249.2832398
Lomuscio AMichaliszyn J(2014)An abstraction technique for the verification of multi-agent systems against ATL specificationsProceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning10.5555/3031929.3031981(428-437)Online publication date: 20-Jul-2014
https://dl.acm.org/doi/10.5555/3031929.3031981
Pilecki JBednarczyk MJamroga W(2014)Synthesis and Verification of Uniform Strategies for Multi-agent SystemsComputational Logic in Multi-Agent Systems10.1007/978-3-319-09764-0_11(166-182)Online publication date: 2014
https://doi.org/10.1007/978-3-319-09764-0_11
Jamroga WMȩski ASzreter M(2013)Modularity and Openness in Modeling Multi-Agent SystemsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.119.19119(224-239)Online publication date: 16-Jul-2013
https://doi.org/10.4204/EPTCS.119.19
Calta JShkatov D(2011)Synthesizing strategies for homogenous multi-agent systems with incomplete informationProceedings of the 12th international conference on Computational logic in multi-agent systems10.5555/2044543.2044556(122-138)Online publication date: 17-Jul-2011
https://dl.acm.org/doi/10.5555/2044543.2044556
Köster MLohmann PSonenberg LStone PTumer KYolum P(2011)Abstraction for model checking modular interpreted systems over ATLThe 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 310.5555/2034396.2034452(1129-1130)Online publication date: 2-May-2011
https://dl.acm.org/doi/10.5555/2034396.2034452
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents