Cache coherence protocols: evaluation using a multiprocessor simulation model
ACM Transactions on Computer Systems (TOCS)
Formal theories of knowledge in AI and robotics
New Generation Computing
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Reasoning about knowledge
A partial order approach to branching time logic model checking
Information and Computation
Model checking
Improving partial order reductions for universal branching time properties
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Symbolic Model Checking
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Verification of Hybrid Systems Using Abstractions
Hybrid Systems II
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Using Partial Orders to Improve Automatic Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Combining Partial Order Reductions with On-the-fly Model-Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
VerICS 2007 - a Model Checker for Knowledge and Real-Time
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Stronger reduction criteria for local first search
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
The BMC method for the existential part of RTCTLK and interleaved interpreted systems
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Exponential acceleration of model checking for perfect recall systems
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Bounded model checking for knowledge and linear time
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
SAT-Based bounded model checking for deontic interleaved interpreted systems
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Two approaches to bounded model checking for linear time logic with knowledge
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Programming and Computing Software
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
We investigate partial order reduction for model checking multiagent systems by focusing on interleaved interpreted systems. These are a particular class of interpreted systems, a mainstream MAS formalism, in which only one action at the time is performed. We present a notion of stuttering-equivalence, and prove the semantical equivalence of stuttering-equivalent traces with respect to linear and branching time temporal logics for knowledge without the next operator. We give algorithms to reduce the size of the models before the model checking step and show preservation properties. We evaluate the technique by discussing the experimental results obtained against well-known examples in the MAS literature.