Model checking for context-free processes
- 30 September 2006
- book chapter
- Published by Springer Nature
- p. 123-137
- https://doi.org/10.1007/bfb0084787
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Proof systems for Hennessy-Milner Logic with recursionPublished by Springer Nature ,2005
- A linear-time model-checking algorithm for the alternation-free modal mu-calculusPublished by Springer Nature ,1992
- Computing behavioural relations, logicallyPublished by Springer Nature ,1991
- Tableau-based model checking in the propositional mu-calculusActa Informatica, 1990
- Local model checking in the modal mu-calculusLecture Notes in Computer Science, 1989
- Decidability of bisimulation equivalence for processes generating context-free languagesPublished by Springer Nature ,1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- 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
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955