Uniform labeled transition systems for nondeterministic, probabilistic, and stochastic process calculi

Bernardo, Marco and De Nicola, Rocco and Loreti, Michele Uniform labeled transition systems for nondeterministic, probabilistic, and stochastic process calculi. Electronic Proceedings in Theoretical Computer Science, 60. pp. 66-75. ISSN 2075-2180 (2011)

Preview

PDF - Published Version Download (108kB) | Preview

Abstract

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.

Item Type:	Article
Identification Number:	10.4204/EPTCS.60.5
Additional Information:	Proceedings First International Workshop on Process Algebra and Coordination, Reykjavik, Iceland, 9th June 2011
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area:	Computer Science and Applications
Depositing User:	Rocco De Nicola
Date Deposited:	11 Aug 2011 08:37
Last Modified:	27 Sep 2011 13:11
URI:	http://eprints.imtlucca.it/id/eprint/794

Actions (login required)

Edit Item