State Space Reduction Using Partial τ-Confluence
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 383-393
- https://doi.org/10.1007/3-540-44612-5_34
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An efficient algorithm for branching bisimulation and stuttering equivalencePublished by Springer Nature ,2005
- State Space Reduction Using Partial τ-ConfluencePublished by Springer Nature ,2000
- Verification of the Link layer protocol of the IEEE-1394 serial bus (FireWire): an experiment with E-LOTOSInternational Journal on Software Tools for Technology Transfer, 1998
- Confluence for process verificationTheoretical Computer Science, 1996
- Branching time and abstraction in bisimulation semanticsJournal of the ACM, 1996
- Linearity and the pi-calculusPublished by Association for Computing Machinery (ACM) ,1996
- A Partial Approach to Model CheckingInformation and Computation, 1994
- A Correctness Proof of a One-bit Sliding Window Protocol in CRLThe Computer Journal, 1994
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987