An efficient algorithm for branching bisimulation and stuttering equivalence
- 27 June 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
- p. 626-638
- https://doi.org/10.1007/bfb0032063
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Back and forth bisimulationsPublished by Springer Science and Business Media LLC ,1990
- Characterizing finite Kripke structures in propositional temporal logicTheoretical Computer Science, 1988
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Research on Automatic Verification of Finite-State Concurrent SystemsAnnual Review of Computer Science, 1987
- Matrix multiplication via arithmetic progressionsPublished by Association for Computing Machinery (ACM) ,1987
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- CCS expressions, finite state processes, and three problems of equivalencePublished by Association for Computing Machinery (ACM) ,1983
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980