z-logo
open-access-imgOpen Access
Axioms for Probability and Nondeterminism
Author(s) -
Michael Mislove,
Joël Ouaknine,
James Worrell
Publication year - 2004
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2004.04.019
Subject(s) - nondeterministic algorithm , denotational semantics , finitary , axiom , probabilistic logic , denotational semantics of the actor model , operational semantics , simple (philosophy) , denotation (semiotics) , mathematics , domain (mathematical analysis) , normalisation by evaluation , bisimulation , domain theory , process calculus , discrete mathematics , semantics (computer science) , algebra over a field , computer science , pure mathematics , theoretical computer science , programming language , mathematical analysis , philosophy , statistics , linguistics , geometry , epistemology , semiotics
This paper studies a simple calculus for finite-state processes featuring both nondeterministic and probabilistic choice. We present a domain model and an operational semantics for our calculus. The denotational model uses the probabilistic powerdomain of Jones and Plotkin, combined with a geometrically convex variant of the Plotkin powerdomain. The operational model defines transition rules under which a process makes transitions to probability distributions over states. We prove a full abstraction result that shows two processes have the same denotation if and only if they are probabilistically bisimilar. We also show that the expected laws for probability and nondeterminism are sound and complete with respect to the denotational model

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom