Extending Process Languages with Time

In recent years a large number of process languages with time have been developed as more realistic formalisms for description and reasoning about concurrent systems. We propose a uniform framework, based on the ordered structural operational semantics (SOS) approach, for extending arbitrary process languages with discrete time. The generality of our framework allows the user to select the most suitable timed process language for a task in hand. This is possible because the user can choose any operators, whether they are standard or new application-specific operators, provided that they preserve a version of weak bisimulation and all processes in the considered language satisfy the time determinacy property. We also propose several constraints on ordered SOS rules for the operators such that some other properties, which reflect the nature of time passage, are satisfied.

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

[2]  Iain C. C. Phillips,et al.  Formats of Ordered SOS Rules with Silent Actions , 1997, TAPSOFT.

[3]  Joseph Sifakis,et al.  The Algebra of Timed Processes, ATP: Theory and Application , 1994, Inf. Comput..

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

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

[6]  Frits W. Vaandrager,et al.  Turning SOS Rules into Equations , 1994, Inf. Comput..

[7]  Steve A. Schneider,et al.  An Operational Semantics for Timed CSP , 1995, Inf. Comput..

[8]  Jan Friso Groote,et al.  Specification and verification of real time systems in ACP , 1990, PSTV.

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

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

[11]  Joseph Sifakis,et al.  ATP: an Algebra for Timed Processes , 1990, Programming Concepts and Methods.

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

[13]  Guy Leduc,et al.  An Introduction to ET-LOTOS for the Description of Time-Sensitive Systems , 1997, Comput. Networks ISDN Syst..

[14]  Bard Bloom,et al.  Structural Operational Semantics for Weak Bisimulations , 1995, Theor. Comput. Sci..

[15]  Robin Milner,et al.  A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.

[16]  Matthew Hennessy.  Timed Process Algebras: A Tutorial , 1992, NATO ASI PDC.

[17]  D. J. Walker,et al.  Bisimulation and Divergence , 1990, Inf. Comput..

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

[19]  Alan Jeffrey,et al.  A Linear Time Process Algebra , 1991, CAV.

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

[21]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..

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