Absolute versus relative time in process algebras

Abstract Timed process algebras are useful tools for the specification and verification of real time systems. We study the relationships between two of these algebras, c I pa ('Closed Interval Process Algebra') and TCCS ('Temporal CCS') which deal with temporal aspects of concurrent systems by following very different interpretations: durational actions versus durationless actions, absolute time versus relative time, timed functional behavior versus time and functional behavior, local clocks versus global clocks. We show that these different choices are not irreconcilable by presenting a simple mapping from c I pa to TCCS which preserves the behavioral equivalences over the two timed calculi.

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

[2]  Marco Roccetti,et al.  A Theory of Processes with Durational Actions , 1995, Theor. Comput. Sci..

[3]  Matthew Hennessy,et al.  A Temporal Process Algebra , 1990, FORTE.

[4]  Rance Cleaveland,et al.  A theory of testing for real-time , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[5]  Faron Moller,et al.  Relating Processes With Respect to Speed , 1991, CONCUR.

[6]  Gian Luigi Ferrari,et al.  Dynamic Matrices and the Cost Analysis of Concurrent Programs , 1995, AMAST.

[7]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

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

[9]  Marco Roccetti,et al.  Towards Performance Evaluation in Process Algebras , 1993, AMAST.

[10]  P. H. Lindsay.  Human Information Processing , 1977 .

[11]  Walter Vogler,et al.  Timed Testing of Concurrent Systems , 1993, Inf. Comput..

[12]  Marco Pistore,et al.  Specification and Verification of Timed Lazy Systems , 1996, MFCS.

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

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

[15]  Jan A. Bergstra,et al.  Process theory based on bisimulation semantics , 1988, REX Workshop.

[16]  Rance Cleaveland,et al.  An algebraic theory of process efficiency , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

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

[18]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[19]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[20]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.