Efficient checking of behavioural relations and modal assertions using fixed-point inversion
Authors:
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 142-154
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Model checking and boolean graphsTheoretical Computer Science, 1994
- On model-checking for fragments of μ-calculus1993
- Computing Ready Simulations Efficiently1993
- 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