Processes with probabilities, priority and time
Author:
Open Access
- 1 September 1994
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 6 (5) , 536-564
Abstract
A probabilistic calculus, derived from Milner's SCCS, WSCCS is presented. We define a notion of bisimulation for probabilistic processes and show that it is a congruence. A simple equational characterisation is shown to be both sound and complete for finite processes. We present many examples including some extended ones. The larger examples show both the expressive power of WSCCS and the availability of simple proof methods for some complex systems.Keywords
This publication has 7 references indexed in Scilit:
- Doing the right thing: Ants, honeybees and naked mole-ratsTrends in Ecology & Evolution, 1992
- The autosynchronization of the ant Leptothorax acervorum (Fabricius): Theory, testability and experimentJournal of Theoretical Biology, 1992
- Mutual exclusion as a mechanism for information exchange within ant nestsThe Science of Nature, 1992
- Bisimulation through probabilistic testing (preliminary report)1989
- Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra1Fundamenta Informaticae, 1986
- Notes on Communicating Sequential Systems1986
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983