Efficient checking of behavioural relations and modal assertions using fixed-point inversion
- 1 January 1995
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 142-154
- https://doi.org/10.1007/3-540-60045-0_47
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An efficient algorithm for branching bisimulation and stuttering equivalencePublished by Springer Science and Business Media LLC ,2005
- Symbolic model checking: 10/sup 20/ states and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Model checking and boolean graphsTheoretical Computer Science, 1994
- On model-checking for fragments of μ-calculusLecture Notes in Computer Science, 1993
- Computing Ready Simulations EfficientlyPublished by Springer Science and Business Media LLC ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972