## A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time (1998)

### Cached

### Download Links

- [www.sti.uniurb.it]
- [ftp.cs.unibo.it]
- [www.cs.unibo.it]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 95 - 9 self |

### BibTeX

@ARTICLE{Bernardo98atutorial,

author = {Marco Bernardo and Roberto Gorrieri},

title = {A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time},

journal = {Theoretical Computer Science},

year = {1998},

volume = {202},

pages = {1--54}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this tutorial we give an overview of the process algebra EMPA, a calculus devised in order to model and analyze features of real-world concurrent systems such as nondeterminism, priorities, probabilities and time, with a particular emphasis on performance evaluation. The purpose of this tutorial is to explain the design choices behind the development of EMPA and how the four features above interact, and to show that a reasonable trade off between the expressive power of the calculus and the complexity of its underlying theory has been achieved.