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

203Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

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. © 1998 - Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Bernardo, M., & Gorrieri, R. (1998, July 28). A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/S0304-3975(97)00127-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free