A partial order approach to branching time logic model checking
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- An efficient algorithm for branching bisimulation and stuttering equivalencePublished by Springer Nature ,2005
- A stubborn attack on state explosionPublished by Springer Nature ,2005
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- A partial approach to model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Verification of distributed programs using representative interleaving sequencesDistributed Computing, 1992
- Coverage Preserving Reduction Strategies for Reachability AnalysisPublished by Elsevier ,1992
- Efficient verification of determinate processesPublished by Springer Nature ,1991
- Characterizing finite Kripke structures in propositional temporal logicTheoretical Computer Science, 1988
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986