Towards action refinement for concurrent systems with causal ambiguity

Action refinement is a core operation in the hierarchical design methodology for concurrent systems. In this paper we develop an action refinement approach for concurrent systems with the notion of causal ambiguity, which often exists and appears in real application areas. The systems are modelled in terms of event structures with causal ambiguity. We demonstrate that the behavior of the lower-level system is itself derived from the behavior of the high-level system : Under a certain partial order semantics, the behavior of the refined system can be inferred compositionally from the behavior of the original system and from the behavior of the systems used to substitute actions with explicitly represented start points. Furthermore, a variant of a linear-time equivalence termed pomset trace equivalence and a variant of a branching-time equivalence termed history preserving bisimulation equivalence based on the partial order semantics are both congruences under the refinement. The refinement operation behaves thus well and meets the commonly expected properties.

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

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

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

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

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

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

[7]  Arend Rensink Models and Methods for Action Refinement , 1993 .

[8]  Luca Aceto,et al.  Adding Action Refinement to a Finite Process Algebra , 1991, Inf. Comput..

[9]  Tommaso Bolognesi,et al.  Cumulating constraints on the "WHEN" and the "WHAT" , 1993, Formal Techniques for (Networked and) Distributed Systems.

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

[11]  Luis Ferreira Pires,et al.  Architectural notes: a framework for distributed systems development , 1994 .

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

[13]  R. V. Glabbeek CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes , 2001 .

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

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

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

[17]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

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

[19]  Jinzhao Wu,et al.  Refinement of actions in a real-time process algebra with a true concurrency model , 2002, Electron. Notes Theor. Comput. Sci..

[20]  Henry M. Franken,et al.  A Development Model for Distributed Information Systems , 1995 .

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

[22]  Jinzhao Wu,et al.  Towards action refinement for true concurrent real time , 2003, Acta Informatica.

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

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

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

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

[27]  Jeremy Gunawardena,et al.  Causal automata , 1992, Theor. Comput. Sci..

[28]  Luciano Lavagno,et al.  On the models for asynchronous circuit behaviour with OR causality , 1996, Formal Methods Syst. Des..