De Nicola, Rocco and Latella, Diego and Loreti, Michele and Massink, Mieke
A uniform definition of stochastic process calculi.
CSA Technical Report
IMT Institute for Advanced Studies Lucca
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; α;P). The first andthe second components are the source state, s, and the label, α, of the transition, while the third component is the continuation function, P, associating a value of a suitable type to each state s0. For example, in the case of stochastic process algebras the value of the continuation function on s0 represents the rate of the negative exponential distribution characterizing the duration/delay of the action performed to reach state s0 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 non-deterministic behaviors. For each formalism, we establish the formal correspondence between the FuTSs semantics and its original semantics.
(CSA Technical Report)
||To appear in ACM Computing Surveys ; Updated on November 2012
||This work has been partially funded by EU Collaborative project n. 257414 ASCENS, and Project TRACE-IT - PAR FAS 2007-2013 - Regione Toscana
||Categories and Subject Descriptors: F.1.1 [COMPUTATION BY ABSTRACT DEVICES]: Models of Computation; G.3 [PROBABILITY AND STATISTICS]: ; G.2.1 [SOFTWARE ENGINEERING]: Requirements/Specifications
||Q Science > QA Mathematics > QA75 Electronic computers. Computer science
||Computer Science and Applications
Ms T. Iannizzi
||24 Jul 2012 13:23
||19 Apr 2013 12:42
Actions (login required)