A Family of Resource-Bound Real-Time Process Algebras

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.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[2]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[3]  Insup Lee,et al.  A Complete Axiomatization of Finite-State ACSR Processes , 1997, Inf. Comput..

[4]  R. Saigal.  Linear Programming: A Modern Integrated Analysis , 1995 .

[5]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[6]  Insup Lee,et al.  A process algebraic approach to the specification and analysis of resource-bound real-time systems , 1994, Proc. IEEE.

[7]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..

[8]  Insup Lee,et al.  Symbolic schedulability analysis of real-time systems , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[9]  Rance Cleaveland,et al.  Praobabilistic Resource Failure in Real-Time Process Algebra , 1998, CONCUR.

[10]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[11]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[12]  Insup Lee,et al.  Weak Bisimulation for Probabilistic Systems , 2000, CONCUR.

[13]  Huimin Lin,et al.  Symbolic Transition Graph with Assignment , 1996, CONCUR.

[14]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[15]  Insup Lee,et al.  A Process Algebra of Communicating Shared Resources with Dense Time and Priorities , 1997, Theor. Comput. Sci..