Weak bisimulation for fully probabilistic processes
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 119-130
- https://doi.org/10.1007/3-540-63166-6_14
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- An efficient algorithm for branching bisimulation and stuttering equivalencePublished by Springer Nature ,2005
- Branching time and abstraction in bisimulation semanticsJournal of the ACM, 1996
- Reactive, Generative, and Stratified Models of Probabilistic ProcessesInformation and Computation, 1995
- A logic for reasoning about time and reliabilityFormal Aspects of Computing, 1994
- Probabilistic VerificationInformation and Computation, 1993
- Bisimulation through probabilistic testingInformation and Computation, 1991
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Verification of multiprocess probabilistic protocolsDistributed Computing, 1986
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983