Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Process Calculi

Marco Bernardo
(Dipartimento di Scienze di Base e Fondamenti – Universita' di Urbino – Italy)
Rocco De Nicola
(IMT – Institute for Advanced Studies Lucca – Italy and Dipartimento di Sistemi e Informatica – Universita' di Firenze – Italy)
Michele Loreti
(Dipartimento di Sistemi e Informatica – Universita' di Firenze – Italy)

Labeled transition systems are typically used to represent the behavior of nondeterministic processes, with labeled transitions defining a one-step state to-state reachability relation. This model has been recently made more general by modifying the transition relation in such a way that it associates with any source state and transition label a reachability distribution, i.e., a function mapping each possible target state to a value of some domain that expresses the degree of one-step reachability of that target state. In this extended abstract, we show how the resulting model, called ULTraS from Uniform Labeled Transition System, can be naturally used to give semantics to a fully nondeterministic, a fully probabilistic, and a fully stochastic variant of a CSP-like process language.

Invited Paper in Luca Aceto and Mohammad Reza Mousavi: Proceedings First International Workshop on Process Algebra and Coordination (PACO 2011), Reykjavik, Iceland, 9th June 2011, Electronic Proceedings in Theoretical Computer Science 60, pp. 66–75.
Published: 6th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.60.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org