Probabilistic Extensions of Process Algebras**This chapter is dedicated to the fond memory of Linda Christoff.
Authors:
- Bengt JonssonBJBengt Jonsson
- Wang YiWYWang Yi
- Kim G. LarsenKLKim G. Larsen
- 1 January 2001
- book chapter
- Published by Elsevier
- p. 685-710
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Metrics for Labeled Markov Systems1999
- Weak bisimulation for fully probabilistic processes1997
- A logic for reasoning about time and reliabilityFormal Aspects of Computing, 1994
- Reasoning About Probabilistic Behavior in Concurrent SystemsIEEE Transactions on Software Engineering, 1987
- Observation equivalence as a testing equivalenceTheoretical Computer Science, 1987
- Verification of multiprocess probabilistic protocolsDistributed Computing, 1986
- Higher-level synchronising devices in Meije-SCCSTheoretical Computer Science, 1985
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Testing equivalences for processesTheoretical Computer Science, 1984
- Performance Analysis Using Stochastic Petri NetsIEEE Transactions on Computers, 1982