Towards action refinement for true concurrent real time

Abstract.Action refinement is an essential operation in the design of concurrent systems, real-time or not. In this paper we develop a theory of action refinement in a real-time non-interleaving causality based setting, a timed extension of bundle event structures that allows for urgent interactions to model timeout. The syntactic action refinement operation is presented in a timed process algebra as incorporated in the internationally standardised specification language LOTOS. We show that the behaviour of the refined system can be inferred compositionally from the behaviour of the original system and from the behaviour of the processes substituted for actions with explicitly represented start points, that the timed versions of a linear-time equivalence, termed pomset trace equivalence, and a branching-time equivalence, termed history preserving bisimulation equivalence, are both congruences under the refinement, and that the syntactic and semantic action refinements developed coincide under these equivalence relations with respect to a metric denotational semantics. Therefore, our refinement operations behave well. They meet the commonly expected properties.

[1]  L. Aceto.  Action refinement in process algebras , 1992 .

[2]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[3]  Joost-Pieter Katoen,et al.  Quantitative and Qualitative Extensions of Event Structures , 1996 .

[4]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[5]  David Murphy,et al.  Time and Duration in Nininterleaving Concurrency , 1993, Fundam. Informaticae.

[6]  Steve A. Schneider.  Timewise Refinement for Communicating Processes , 1993, MFPS.

[7]  Arend Rensink,et al.  On Syntactic and Semantic Action Refinement , 1994, TACS.

[8]  Ursula Goltz,et al.  Interleaving semantics and action refinement with atomic choice , 1992, Advances in Petri Nets: The DEMON Project.

[9]  Jim Davies,et al.  A Brief History of Timed CSP , 1995, Theor. Comput. Sci..

[10]  Steve A. Schneider,et al.  Timewise Refinement for Communicating Processes , 1993, Sci. Comput. Program..

[11]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[12]  Joost-Pieter Katoen,et al.  A true concurrency semantics for ET-LOTOS , 1998, Proceedings 1998 International Conference on Application of Concurrency to System Design.

[13]  Glynn Winskel,et al.  Event Structure Semantics for CCS and Related Languages , 1982, ICALP.

[14]  David Murphy,et al.  On the Ill-Timed but Well-Caused , 1993, CONCUR.

[15]  Maria Sorea,et al.  A Priori Verification of Reactive Systems , 2000, FORTE.

[16]  Jinzhao Wu,et al.  Bundle event structures: A revised cpo approach , 2002, Inf. Process. Lett..

[17]  Diego Latella,et al.  On Specifying Real-Time Systems in a Causality-Based Setting , 1996, FTRTFT.

[18]  Christel Baier,et al.  Metric semantics for true concurrent real time , 2001, Theor. Comput. Sci..

[19]  Jinzhao Wu,et al.  Action Refinement for Probabilistic Processes with True Concurrency Models , 2002, PAPM-PROBMIV.

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

[21]  Giorgio De Michelis,et al.  Concurrency versus interleaving: an instructuve example , 1987, Bull. EATCS.

[22]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .

[23]  Mila E. Majster-Cederbaum,et al.  Correctness by Construction: Towards Verification in Hierarchical System Development , 2000, SPIN.

[24]  Rom Langerak,et al.  Bundle event structures: a non-interleaving semantics for LOTOS , 1992, FORTE.

[25]  Arend Rensink,et al.  Action Refinement , 1999, Handbook of Process Algebra.

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

[27]  Angelo Gargantini,et al.  A Theory of Implementation and Refinement in Timed Petri Nets , 1998, Theor. Comput. Sci..

[28]  Diego Latella,et al.  A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions , 1996, Formal Methods Syst. Des..

[29]  Rita Loogen,et al.  Modelling nondeterministic concurrent processes with event structures , 1991, Fundam. Informaticae.

[30]  David Murphy,et al.  Real-Timed Concurrent Refineable Behaviours , 1992, FTRTFT.

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

[32]  Niklaus Wirth,et al.  Program development by stepwise refinement , 1971, CACM.

[33]  Klaus Schneider.  Verification of Reactive Systems , 2004, Texts in Theoretical Computer Science.

[34]  Jan A. Bergstra,et al.  The State Operator in Real Time Process Algebra , 1991, REX Workshop.

[35]  Ursula Goltz,et al.  Refinement of Actions in Causality Based Models , 1990, REX Workshop.

[36]  John Zic.  Time-constrained buffer specifications in CSP + T and timed CSP , 1994, TOPL.

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

[38]  Jinzhao Wu,et al.  Adding Action Refinement to Stochastic True Concurrency Models , 2003, ICFEM.

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

[40]  Jinzhao Wu,et al.  Action refinement for true concurrent real time , 2001, Proceedings Seventh IEEE International Conference on Engineering of Complex Computer Systems.

[41]  Howard Bowman,et al.  Extending LOTOS with Time: A True Concurrency Perspective , 1997, ARTS.

[42]  Rob J. van Glabbeek,et al.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[43]  Jan A. Bergstra,et al.  Real time process algebra , 1991, Formal Aspects of Computing.

[44]  Joost-Pieter Katoen,et al.  Causal Ambiguity and Partial Orders in Event Structures , 1997, CONCUR.

[45]  Walter Vogler,et al.  A Faster-than Relation for Asynchronous Processes , 2001, CONCUR.

[46]  Ursula Goltz,et al.  Refinement of actions and equivalence notions for concurrent systems , 2001, Acta Informatica.

[47]  Tommaso Bolognesi,et al.  Converging towards a timed LOTOS standard , 1994 .