Decentralized bisimulation for multiagent systems

Song, L; Feng, Y; Zhang, L

Decentralized bisimulation for multiagent systems

Song, L Feng, Y

Zhang, L

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, 2015, 1 pp. 209 - 217
Issue Date:: 2015-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted Manuscript versionAdobe PDF (333.44 kB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Song, L	en_US
dc.contributor.author	Feng, Y https://orcid.org/0000-0002-3097-3896	en_US
dc.contributor.author	Zhang, L	en_US
dc.date.issued	2015-01-01	en_US
dc.identifier.citation	Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, 2015, 1 pp. 209 - 217	en_US
dc.identifier.isbn	9781450337694	en_US
dc.identifier.issn	1548-8403	en_US
dc.identifier.uri	http://hdl.handle.net/10453/47652
dc.description.abstract	Copyright © 2015, International Foundation for Autonomous Agents and Multiagent Systems. The notion of bisimulation has been introduced as a powerful way to abstract from details of systems in the formal verification community. When applying to multiagent systems, classical bisimulations will allow one agent to make decisions based on full histories of others. Thus, as a general concept, classical bisimulations are unrealistically powerful for such systems. In this paper, we define a coarser notion of bisimulation under which an agent can only make realistic decisions based on information available to it. Our bisimulation still implies trace distribution equivalence of the systems, and moreover, it allows a compositional abstraction framework of reasoning about the systems.	en_US
dc.relation.ispartof	Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS	en_US
dc.title	Decentralized bisimulation for multiagent systems	en_US
dc.type	Conference Proceeding
utslib.citation.volume	1	en_US
utslib.for	080203 Computational Logic and Formal Languages	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US
pubs.volume	1	en_US

Abstract:

Copyright © 2015, International Foundation for Autonomous Agents and Multiagent Systems. The notion of bisimulation has been introduced as a powerful way to abstract from details of systems in the formal verification community. When applying to multiagent systems, classical bisimulations will allow one agent to make decisions based on full histories of others. Thus, as a general concept, classical bisimulations are unrealistically powerful for such systems. In this paper, we define a coarser notion of bisimulation under which an agent can only make realistic decisions based on information available to it. Our bisimulation still implies trace distribution equivalence of the systems, and moreover, it allows a compositional abstraction framework of reasoning about the systems.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/47652