Abstraction in Probabilistic Process Algebra
- 23 March 2001
- book chapter
- Published by Springer Nature
- p. 204-219
- https://doi.org/10.1007/3-540-45319-9_15
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An efficient algorithm for branching bisimulation and stuttering equivalencePublished by Springer Nature ,2005
- Process Algebra with Probabilistic ChoicePublished by Springer Nature ,1999
- Weak bisimulation for fully probabilistic processesPublished by Springer Nature ,1997
- Axiomatizing Probabilistic Processes: ACP with Generative ProbabilitiesInformation and Computation, 1995
- Process AlgebraPublished by Cambridge University Press (CUP) ,1990
- On the consistency of Koomen's Fair Abstraction RuleTheoretical Computer Science, 1987