Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Reasoning about knowledge
Model checking
Alternating-time temporal logic
Journal of the ACM (JACM)
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Symbolic Model Checker for ACTL
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
NUSMV: A New Symbolic Model Verifier
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Generating BDDs for Symbolic Model Checking in CCS
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Generating BDD Models for Process Algebra Terms
Proceedings of the 7th International Conference on Computer Aided Verification
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
Automatic verification of knowledge and time with NuSMV
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
Using α-ctl to Specify Complex Planning Goals
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Experimental Evaluation of a Planning Language Suitable for Formal Verification
Model Checking and Artificial Intelligence
Implementation of Epistemic Operators for Model Checking Multi-agent Systems
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
The linear temporal logic of rewriting Maude model checker
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Symbolic model checking commitment protocols using reduction
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Verifying conformance of multi-agent commitment-based protocols
Expert Systems with Applications: An International Journal
Efficient handling of large signalling-regulatory networks by focusing on their core control
CMSB'12 Proceedings of the 10th international conference on Computational Methods in Systems Biology
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Reasoning about agents and modalities such as knowledge and belief leads to models where different relations over states co-exist, or equivalently, where information (labels, actions) is associated to state transitions. This paper discusses how to augment classical CTL symbolic model-checking to support logics with actions such as A-CTL (action-CTL), and how this can be implemented using BDDs in tools such as the SMV/NuSMV package. Considering general action-state structures, we first propose a natural extension of CTL to actions, called Action-Restricted CTL (ARCTL) and adapt classical results from CTL to express model checking based on three functions eax, eauand eag. On these grounds, we present two different implementations of symbolic model checking with actions. The first approach encodes action-state models and logics into pure state-based models and logics, that can be checked with existing model-checkers. The second approach consists in a native implementation of the three extended operators. We report on our prototype implementation of both approaches based on NuSMV and give an overview of how this is used to model-check the temporal epistemic logic CTLK.