Axioms for probability and nondeterminism

Electronic Notes in Theoretical Computer Science

Volumn 96, Issue , 2004, Pages 7-28

  Mislove, Michael ^a   Ouaknine, Joël ^b   Worrell, James ^a  

^a Tulane University   (United States)

^b Carnegie Mellon University ^*  (United States)

Author keywords

CCS; Nondeterministic choice; Probabilistic bisimulation; Segala Lynch probabilistic automaton

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBABILITY DISTRIBUTIONS; SEMANTICS;

CCS; NONDETERMINISTIC CHOICE; PROBABILISTIC BISIMULATION; SEGALA-LYNCH PROBABILISTIC AUTOMATON;

COMPUTER SCIENCE;

EID: 18944396423     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.04.019     Document Type: Conference Paper

References (21)

1. Abramsky S. A Domain Equation for Bisimulation. Information and Computation. 92:1991;161-218
2. Aceto L, Esik Z, Ingólfsdóttir A. Equational Axioms for Probabilistic Bisimilarity. Proceedings of 9th AMAST. Lecture Notes in Computer Science. 2422:2002;239-253
3. Andova S. Process algebra with probabilistic choice. Katoen J.-P. Proc. ARTS'99, Bamberg, Germany. Lecture Notes in Computer Science. 1601:1999;111-129 Springer-Verlag
4. Baeten J, Bergstra J, Smolka S. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation. 121:(2):1995;234-255
5. Baier C, Kwiatkowska M. Domain Equations for Probabilistic Processes. Mathematical Structures in Computer Science. 10:2000;665-717
6. Bandini E, Segala R. Axiomatizations for probabilistic bisimulation. Proceedings of ICALP 2001. Lecture Notes in Computer Science. 2076:2001;370-381
7. van Breugel F, Mislove M, Ouaknine J, Worrell J. An intrinsic characterization of approximate probabilistic bisimilarity. Proceedings of FOSSACS 2003. Lecture Notes in Computer Science. 2620:2003;200-215 Springer Verlag
8. van Glabbeek R, Smolka S, Steffen B. Reactive, generative and stratified models of probabilistic processes. Information and Computation. 121:(1):1995;59-80
9. Jung A, Tix R. The Troublesome Probabilistic Powerdomain. Third Workshop on Computation and Approximation, Proceedings. Electronic Notes in Theoretical Computer Science. 13:1998;http://www.elsevier.nl/locate/entcs/volume13.html
10. Gierz G, Hofmann H, Keimel K, Lawson J, Mislove M, Scott D. Continuous Lattices and Domains. 2003;. Cambridge
11. J.I. den Hartog, Probabilistic Extensions of Semantical Models, PhD thesis, Vrije Universiteit Amsterdam, 2002
12. C. Jones. Probabilistic nondeterminism, PhD Thesis, Univ. of Edinburgh, 1990
13. Jonsson B, Larsen K, Yi W. Probabilistic Extensions of Process Algebras. Bergstra J.A, Ponse A, Smolka S. Handbook of Process Algebra. 2001;685-710 Elsevier
14. Larsen K.G, Skou A. Bisimulation through Probabilistic Testing. Information and Computation. 94:(1):1991;1-28
15. Milner R. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences. 28:1984;439-466
16. Mislove M. Nondeterminism and probabilistic choice: obeying the laws. Proceedings 11th CONCUR. Lecture Notes in Computer Science. 1877:1999;350-364
17. C. Morgan, A. McIver, K. Seidel, J. Sanders. Refinement-oriented probability for CSP, Oxford University Computing Laboratory Technical Report TR-1294, 1994
18. Segala R, Lynch N. Probabilistic simulations for probabilistic processes. Proceedings of CONCUR 94. Lecture Notes in Computer Science. 839:1994;481-496
19. Stark E.W, Smolka S.A. A complete axiom system for finite-state probabilistic processes. Proof, Language, and Interaction: Essays in Honour of Robin Milner. 2000;MIT Press
20. R. Tix. Continuous D-cones: Convexity and Powerdomain Constructions. PhD thesis, Technische Universität Darmstadt, 1999
21. Varacca D. The Powerdomain of Indexed Valuations. Proceedings of 17th LICS. 2002;IEEE Computer Society Press