A TUTORIAL ON EMPA - A THEORY OF CONCURRENT PROCESSES WITH NONDETERMINISM, PRIORITIES, PROBABILITIES AND TIME

Citation
M. Bernardo et R. Gorrieri, A TUTORIAL ON EMPA - A THEORY OF CONCURRENT PROCESSES WITH NONDETERMINISM, PRIORITIES, PROBABILITIES AND TIME, Theoretical computer science, 202(1-2), 1998, pp. 1-54
Citations number
48
Categorie Soggetti
Computer Science Theory & Methods","Computer Science Theory & Methods
ISSN journal
03043975
Volume
202
Issue
1-2
Year of publication
1998
Pages
1 - 54
Database
ISI
SICI code
0304-3975(1998)202:1-2<1:ATOE-A>2.0.ZU;2-N
Abstract
In this tutorial we give an overview of the process algebra EMPA, a ca lculus devised in order to model and analyze features of real-world co ncurrent systems such as nondeterminism, priorities, probabilities and time, with a particular emphasis on performance evaluation. The purpo se of this tutorial is to explain the design choices behind the develo pment of EMPA and how the four features above interact, and to show th at a reasonable trade off between the expressive power of the calculus and the complexity of its underlying theory has been achieved. (C) 19 98-Elsevier Science B.V. All rights reserved