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.Comment: In Proceedings PACO 2011, arXiv:1108.145

Bernardo, Marco

De Nicola, Rocco

Loreti, Michele

Electronic Proceedings in Theoretical Computer Science

English

arXiv

Abstract. Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chains with process terms. The transition relation assigns to each process, for each action, the set of possible futures paired with a measure indicating the rates at which they are reached. RTS have been shown to be a uniform model for providing an operational semantics to many stochastic process algebras. In this paper, we define Uniform Labeled TRAnsition Systems (ULTraS) as a generalization of RTS that can be exploited to uniformly describe also nondeterministic and probabilistic variants of process algebras. We then present a general notion of behavioral relation for ULTraS that can be instantiated to capture bisimulation and trace equivalences for fully nondeterministic, fully probabilistic, and fully stochastic processes. 

Marco Bernardo

Rocco De

Nicola Michele Loreti

CiteSeerX

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

DE NICOLA, R

Archivio della ricerca della Scuola IMT Alti Studi Lucca

Uniform Labeled Transition Systems for Nondeterministic, Probabilistic and Stochastic Processes

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

Rocco De Nicola

Michele Loreti

Directory of Open Access Journals

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

Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chains with process terms. The transition relation assigns to each process, for each action, the set of possible futures paired with a measure indicating the rates at which they are reached. RTS have been shown to be a uniform model for providing an operational semantics to many stochastic process algebras. In this paper, we define Uniform Labeled TRAnsition Systems (ULTraS) as a generalization of RTS that can be exploited to uniformly describe also nondeterministic and probabilistic variants of process algebras. We then present a general notion of behavioral relation for ULTraS that can be instantiated to capture bisimulation and trace equivalences for fully nondeterministic, fully probabilistic, and fully stochastic processes

IMT Institutional Repository

Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes

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

Archivio istituzionale della ricerca - Università di Urbino

A Compositional Approach to Performance Modelling.

A Process Algebraic Approach to Software Architecture Design.

A Theory of Communicating Sequential Processes.

A Uniform Framework for Process Models and Behavioral Equivalences of Nondeterministic, Probabilistic, Stochastic, or Mixed Nature. Submitted for journal publication.

Algebraic Laws for Nondeterminism and Concurrency.

Comparative Branching-Time Semantics for Markov Chains.

Formal Veriﬁcation of Parallel Programs.

Interactive Markov Chains.

Introduction to the Numerical Solution of Markov Chains.

On a Uniform Framework for the Deﬁnition of Stochastic Process Languages. In:

Probabilistic Communicating Processes.

Rate-Based Transition Systems for Stochastic Process Calculi. In:

Smolka(1990): Equivalences,Congruences,andComplete Axiomatizationsfor Probabilistic Processes. In:

State to Function Labelled Transition Systems: A Uniform Framework for Deﬁning Stochastic Process Calculi.

Testing Equivalencesfor Processes.

The Linear Time – BranchingTime Spectrum I. In:

Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes. In:

http://doaj.org/search?source=%7B%22query%22%3A%7B%22bool%22%3A%7B%22must%22%3A%5B%7B%22term%22%3A%7B%22id%22%3A%228a66fcb554c841d58c919e6d21e948ba%22%7D%7D%5D%7D%7D%7D

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

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

Abstract

Similar works

Full text

Available Versions

CiteSeerX

Archivio della ricerca della Scuola IMT Alti Studi Lucca

Directory of Open Access Journals

IMT Institutional Repository

Archivio istituzionale della ricerca - Università di Urbino

Archivio istituzionale della ricerca - Università di Urbino

IMT Institutional Repository