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

被引:144
作者
Bernardo, M [1 ]
Gorrieri, R [1 ]
机构
[1] Univ Bologna, Dipartimento Sci Informaz, I-40127 Bologna, Italy
关键词
process algebra; priority; probability; Markov chain; bisimulation equivalence;
D O I
10.1016/S0304-3975(97)00127-8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. (C) 1998-Elsevier Science B.V. All rights reserved
引用
收藏
页码:1 / 54
页数:54
相关论文
共 48 条
[1]  
Baeten J. C. M., 1986, Fundamenta Informaticae, V9, P127
[2]  
Baeten J. C. M., 1991, Formal Aspects of Computing, V3, P142, DOI 10.1007/BF01898401
[3]   AXIOMATIZING PROBABILISTIC PROCESSES - ACP WITH GENERATIVE PROBABILITIES [J].
BAETEN, JCM ;
BERGSTRA, JA ;
SMOLKA, SA .
INFORMATION AND COMPUTATION, 1995, 121 (02) :234-255
[4]   PROCESS ALGEBRA FOR SYNCHRONOUS COMMUNICATION [J].
BERGSTRA, JA ;
KLOP, JW .
INFORMATION AND CONTROL, 1984, 60 (1-3) :109-137
[5]  
Bernardo M., 1996, LECT NOTES COMPUTER, V1119, P315
[6]  
BERNARDO M, 1995, UBLCS9514 U BOL
[7]   INTRODUCTION TO THE ISO SPECIFICATION LANGUAGE LOTOS [J].
BOLOGNESI, T ;
BRINKSMA, E .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1987, 14 (01) :25-59
[8]   CCS WITH PRIORITY CHOICE [J].
CAMILLERI, J ;
WINSKEL, G .
INFORMATION AND COMPUTATION, 1995, 116 (01) :26-37
[9]   PRIORITIES IN PROCESS ALGEBRAS [J].
CLEAVELAND, R ;
HENNESSY, M .
INFORMATION AND COMPUTATION, 1990, 87 (1-2) :58-77
[10]  
CLEAVELAND R, 1996, LNCS, V1119, P34