Tableau-based model checking in the propositional mu-calculus
Acta Informatica
An introduction to modal and temporal logics for CCS
Proceedings of the UK/Japan workshop on Concurrency : theory, language, and architecture: theory, language, and architecture
Safety for branching time semantics
Proceedings of the 18th international colloquium on Automata, languages and programming
Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Compositional checking of satisfaction
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Selective mu-calculus and formula-based equivalence of transition systems
Journal of Computer and System Sciences
Communication and Concurrency
A Complete Compositional Model Proof System for a Subset of CCS
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Compositional Model Checking for Linear-Time Temporal Logic
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Property Preserving Simulations
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Selective µ-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
| Hi-index | 0.00 |
Model checking is an automatic technique for verifying properties of finite concurrent systems on a structure that represents the states of the system; the crucial point of the technique is to avoid the computation of all the possible states. In this paper a method of proof for concurrent systems is presented that combines several approaches to meet the previous goal. The method exploits compositionality issues, in the presence of a parallel composition of processes, to compute at most the states of each sequential process, and not their combinations; moreover the method employs abstraction techniques to compute but a subset of the states of each sequential process. Finally, tableau-based proofs are used to allow the dynamic generation of the system states when needed, taking into account the goal of the formula verification. The tableau system is proved finite, sound and complete, for finite state systems.