A family of resource-bound real-time process algebras

被引:0
作者
Lee, I [1 ]
Choi, JY [1 ]
Kwak, HH [1 ]
Philippou, A [1 ]
Sokolsky, O [1 ]
机构
[1] Univ Penn, Philadelphia, PA 19104 USA
来源
FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS | 2001年 / 69卷
关键词
real-time process algebra; probablistic process algebra; value-passing process algebra; schedulability analysis; real-time systems; resource-bound process algebra;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper describes three real-time process algebras, ACSR, PACSR and ACSR-VP. ACSR is a resource-bound real-time process that supports synchronous timed actions and asynchronous instantaneous events as well as the notions of resource, priority, exception, and interrupt. PACSR is a probabilistic extension of ACSR with resources that can fail and associated failure probabilities. ACSR-VP extends ACSR with value passing between processes and parameterized process definitions. This paper also provides three simple real-time system examples to illustrate the expressive power and analysis technique, of each process, algebra.
引用
收藏
页码:443 / 458
页数:16
相关论文
共 18 条
[1]  
BENABDALLAH H, 1996, IRCS9618 U PENNS DEP
[2]   ALGEBRA OF COMMUNICATING PROCESSES WITH ABSTRACTION [J].
BERGSTRA, JA ;
KLOP, JW .
THEORETICAL COMPUTER SCIENCE, 1985, 37 (01) :77-121
[3]   A process algebra of communicating shared resources with dense time and priorities [J].
BremondGregoire, P ;
Lee, I .
THEORETICAL COMPUTER SCIENCE, 1997, 189 (1-2) :179-219
[4]   A complete axiomatization of finite-state ACSR processes [J].
BremondGregoire, P ;
Choi, JY ;
Lee, I .
INFORMATION AND COMPUTATION, 1997, 138 (02) :124-159
[5]   SYMBOLIC BISIMULATIONS [J].
HENNESSY, M ;
LIN, H .
THEORETICAL COMPUTER SCIENCE, 1995, 138 (02) :353-389
[6]  
Hennessy Matthew, 1988, PRESS SERIES FDN COM
[7]  
Hoare C. A. R., 1985, COMMUNICATING SEQUEN
[8]  
KWAK HH, 1998, MSCIS9822 U PENNS DE
[9]  
KWAK HH, 1998, P IEEE REAL TIM SYST
[10]  
LEE I, 1994, P IEEE JAN, P158