Generating the syntactic and semantics graphs for a Markovian process algebra

Authors:
Fernando L. Pelayo;Maria L. Pelayo;Juan L. G. Guirao
Affiliations:
Computing system Department, Polytechnic Engineering High School of Albacete, University of Castilla-La Mancha, Spain;Computing system Department, Polytechnic Engineering High School of Albacete, University of Castilla-La Mancha, Spain;Applied Mathematics & Statistics Department, Polytechnic Engineering High School of Cartagena, Spain
Venue:
Journal of Computational and Applied Mathematics
Year:
2007

Citing 7
Cited 1

Communicating sequential processes

Communicating sequential processes
Algebraic theory of processes

Algebraic theory of processes
Communicating sequential processes

Communications of the ACM
A process algebra for probabilistic and nondeterministic processes

Information Processing Letters
Communication and Concurrency

Communication and Concurrency
A Calculus of Communicating Systems

A Calculus of Communicating Systems
An example of performance evaluation by using the stochastic process algebra: ROSA

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications

Looking for a cheaper ROSA

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II

Quantified Score

Hi-index	7.29

Visualization

Abstract

We present a couple of programs (over C and Mathematica) which allow to generate the syntactic and the semantics representations of a ROSA (ReasoningOnStochasticAlgebras) process. ROSA is a Markovian process algebra for the description and analysis of probabilistic and non-deterministic concurrent processes. ROSA allows us to evaluate performance indexes as well as to check some temporal requirements. As application, we analyse the alternating bit protocol obtaining the average time to send a message, considering that channels may fail with a known probability.