PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
De Nicola R., Latella D., Loreti M., Massink M. A uniform definition of stochastic process calculi. In: ACM Computing Surveys, vol. 46 (1) article n. 5. ACM, 2013.
 
 
Abstract
(English)
We introduce a unifying framework to provide the semantics of process algebras, including their quantitative variants useful for modeling quantitative aspects of behaviors. The unifying framework is then used to describe some of the most representative stochastic process algebras. This provides a general and clear support for an understanding of their similarities and differences. The framework is based on State to Function Labeled Transition Systems, FuTSs for short, that are state transition structures where each transition is a triple of the form (s,α,��). The first and the second components are the source state, s, and the label, α, of the transition, while the third component is the continuation function, ��, associating a value of a suitable type to each state s'. For example, in the case of stochastic process algebras the value of the continuation function on s' represents the rate of the negative exponential distribution characterizing the duration/delay of the action performed to reach state s' from s. We first provide the semantics of a simple formalism used to describe continuous-time Markov chains, then we model a number of process algebras that permit parallel composition of models according to the two main interaction paradigms (multiparty and one-to-one synchronization). Finally, we deal with formalisms where actions and rates are kept separate and address the issues related to the coexistence of stochastic, probabilistic, and nondeterministic behaviors. For each formalism, we establish the formal correspondence between the FuTSs semantics and its original semantics.
URL: http://dl.acm.org/citation.cfm?id=2522973
DOI: 10.1145/2522968.2522973
Subject Continuous Time Markov Chains
Stochastic Process Calculi
Structured Operational Semantics
H.1 MODELS AND PRINCIPLES
F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional