A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Stochastic process algebras—between LOTOS and Markov chains
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
Process algebra for performance evaluation
Theoretical Computer Science
Markovian models for performance and dependability evaluation
Lectures on formal methods and performance analysis
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Formal modeling and quantitative analysis of KLAIM-based mobile systems
Proceedings of the 2005 ACM symposium on Applied computing
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Characterising Testing Preorders for Finite Probabilistic Processes
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Model checking mobile stochastic logic
Theoretical Computer Science
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Combining Timed Coordination Primitives and Probabilistic Tuple Spaces
Trustworthy Global Computing
Rate-Based Transition Systems for Stochastic Process Calculi
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A Process Algebraic Approach to Software Architecture Design
A Process Algebraic Approach to Software Architecture Design
Structural operational semantics for stochastic process calculi
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Uniform labeled transition systems for nondeterministic, probabilistic, and stochastic processes
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
SoSL: a service-oriented stochastic logic
Rigorous software engineering for service-oriented systems
A uniform definition of stochastic process calculi
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
In this paper we show how Rate Transition Systems (RTSs ) can be used as a unifying framework for the definition of the semantics of stochastic process algebras. RTSs facilitate the compositional definition of such semantics exploiting operators on the next state functions which are the functional counterpart of classical process algebra operators. We apply this framework to representative fragments of major stochastic process calculi namely TIPP , PEPA and IML and show how they solve the issue of transition multiplicity in a simple and elegant way. We, moreover, show how RTSs help describing different languages, their differences and their similarities. For each calculus, we also show the formal correspondence between the RTSs semantics and the standard SOS one.