A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time

Authors:
M. Bernardo;R. Gorrieri
Affiliations:
-;-
Venue:
A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time
Year:
1996

Citing 0
Cited 3

Quantitative Observables and Averages in Probabilistic Constraint Programming

Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Continuous-Time Probabilistic KLAIM

Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic linda-based coordination languages

FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an overview of EMPA, a process algebra for modeling and analyzing concurrent systems where nondeterminism, priorities, probabilities and time are present, aiming at a reasonable trade off between the expressive power of the calculus and the complexity of its underlying theory.