Skip to main content
Log in

Refinement of actions and equivalence notions for concurrent systems

  • Original articles
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

We study an operator for refinement of actions to be used in the design of concurrent systems. Actions on a given level of abstraction are replaced by more complicated processes on a lower level. This is done in such a way that the behaviour of the refined system may be inferred compositionally from the behaviour of the original system and from the behaviour of the processes substituted for actions. We recall that interleaving models of concurrent systems are not suited for defining such an operator in its general form. Instead, we define this operator on several causality based, event oriented models, taking into account the distinction between deadlock and successful termination. Then we investigate the interplay of action refinement with abstraction in terms of equivalence notions for concurrent systems, considering both linear time and branching time approaches. We show that besides the interleaving equivalences, also the equivalences based on steps are not preserved under refinement of actions. We prove that linear time partial order semantics are invariant under refinement. Finally we consider various bisimulation equivalences based on partial orders and show that the finest two of them are preserved under refinement whereas the others are not. Termination sensitive versions of these equivalences are even congruences for action refinement.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received 11 May 1998 / 19 June 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

van Glabbeek, R., Goltz, U. Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37, 229–327 (2001). https://doi.org/10.1007/s002360000041

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360000041

Keywords

Navigation