A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version)

One of the most satisfactory results in process theory is Milner's axiomatization of strong bisimulation for regular CCS. This result holds for open terms with finite-state recursion. Wang has shown that timed bisimulation can also be axiomatized, but only for closed terms without recursion. In this paper, we provide an axiomatization for timed bisimulation of open terms with finite-state recursion.

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

[2]  F. Vaandrager,et al.  A Comparison of Additivity Axioms in Timed Transition Systems. , 1993 .

[3]  Johan van Benthem,et al.  Time, logic and computation , 1988, REX Workshop.

[4]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[5]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[6]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[7]  A. Steven Klusener.  Completeness in Real Time Process Algebra , 1991, CONCUR.

[8]  Wang Yi,et al.  Deciding Properties of Regular Real Time Processes , 1991, CAV.

[9]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[10]  Matthew Hennessy,et al.  A Process Algebra for Timed Systems , 1995, Inf. Comput..

[11]  Robin Milner,et al.  A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..

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

[13]  Wang Yi,et al.  CCS + Time = An Interleaving Model for Real Time Systems , 1991, ICALP.

[14]  Yi Wang.  A calculus of real time systems , 1991 .

[15]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[16]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.