Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1
Autonomous Agents and Multi-Agent Systems
Model checking for multivalued logic of knowledge and time
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Bounded model checking for knowledge and real time
Artificial Intelligence
A Compositional Automata-based Approach for Model Checking Multi-Agent Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A flexible framework for verifying agent programs
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Temporal Logics for Representing Agent Communication Protocols
Agent Communication II
Verifying Space and Time Requirements for Resource-Bounded Agents
Model Checking and Artificial Intelligence
Model Checking and Artificial Intelligence
Model checking communicative agent-based systems
Knowledge-Based Systems
Model checking nash equilibria in MAD distributed systems
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Model Checking Communicative Agent-Based Systems
Proceedings of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07
Model-checking memory requirements of resource-bounded reasoners
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Automated Verification of Multi-Agent Programs
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Representing and verifying temporal epistemic properties in multi-agent systems
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
Verification of multi-agent negotiations using the alloy analyzer
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Verification of epistemic properties in probabilistic multi-agent systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Specifying and verifying a MAS: the robots on mars case study
ProMAS'07 Proceedings of the 5th international conference on Programming multi-agent systems
Model checking normative agent organisations
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Formal methods in agent-oriented software engineering
AOSE'10 Proceedings of the 10th international conference on Agent-oriented software engineering
Specifying recursive agents with GDTs
Autonomous Agents and Multi-Agent Systems
Verifying real-time temporal, cooperation and epistemic properties for uncertain agents
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
A formal analysis of KGP agents
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
A tableau method for verifying dialogue game protocols for agent communication
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
Model checking for epistemic and temporal properties of uncertain agents
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Model checking agent programming languages
Automated Software Engineering
An agent-oriented conceptual framework for systems biology
Transactions on Computational Systems Biology III
Verifying protocol conformance for logic-based communicating agents
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Combined model checking for temporal, probabilistic, and real-time logics
Theoretical Computer Science
Hi-index | 0.00 |
We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend the technique of unbounded model checking from a purely temporal setting to a temporal-epistemic one. In order to achieve this, we base our discussion on interpreted systems semantics, a popular semantics used in multi-agent systems literature.We give details of the technique and show how it can be applied to the well-known train, gate and controller problem.