Reversible Barbed Congruence on Configuration Structures

  title={Reversible Barbed Congruence on Configuration Structures},
  author={Cl{\'e}ment Aubert and Ioana Cristescu},
A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equivalences that are more discriminating, i.e. that distinguish the denotation of terms equated by barbed congruence. Hereditary history preserving bisimulation (HHPB) is such a relation. We define a strong back and forth barbed congruence using a reversible process algebra and show that the relation induced by the back… 

Figures from this paper

Rigid Families for CCS and the π-calculus
In this model causality and concurrency are derived from precedence, a partial order local to each run of a process, and it is shown that the causal semantics can interpret CCS and $$\pi $$-calculus terms.
Causal Consistent Replication in Reversible Concurrent Calculi
The system obtained is the first reversible system capable of representing infinite behaviors that enjoys causal consistency, for the simple and purely syntactical notion of reversible concurrency.
Rigid Families for the Reversible π-Calculus
This paper uses rigid families to give a denotational representation to the reversible \(\pi \)-calculus, and discusses the difference in the two causal representations, in rigid families and in the reversible\)calculus.
A safety and liveness theory for total reversibility
This work develops novel fully abstract models of liveness and safety which are based on forward transitions and limited rollback points, giving rise to considerably simpler proof techniques, and proves that adding total reversibility to CCS distinguishes more systems.
Enabling Replications and Contexts in Reversible Concurrent Calculus
This paper designs a process algebra endowed with a mechanism to generate identifiers without the need to consult with the other threads, and uses this calculus to recast the possible representations of non-determinism in CCS, and as a by-product establish a simple and straightforward definition of concurrency.


Bisimulation and Action Refinement
  • W. Vogler
  • Computer Science
    Theor. Comput. Sci.
  • 1993
A Compositional Semantics for the Reversible p-Calculus
We introduce a labelled transition semantics for the reversible π-calculus. It is the first account of a compositional definition of a reversible calculus, that has both concurrency primitives and
Event Structure Semantics for CCS and Related Languages
This work gives denotational semantics to a wide range of parallel programming languages based on the idea of Milner’s CCS, that processes communicate by events of mutual synchronization, and gets an event structure semantics for CCS.
Bisimulation from Open Maps
A general approach yields a logic, generalising Hennessy-Milner logic, which is characteristic for the generalised notion of bisimulation, and a promising new model, presheaves on categories of pomsets, into which the usual category of labelled event structures embeds fully and faithfully.
Reversibility and Models for Concurrency
Reversing Higher-Order Pi
It is proved that reversibility in the authors' calculus is causally consistent and that one can encode faithfully reversible HOπ into a variant of HOπ.
Reversible Communicating Systems
A process algebra RCCS, in the style of CCS, where processes can backtrack is obtained, and it is shown that, given a past, a computation step can be taken back if and only if it leads to a causally equivalent past.
Refinement of actions and equivalence notions for concurrent systems
It is proved that linear time partial order semantics are invariant under refinement and it is investigated the interplay of action refinement with abstraction in terms of equivalence notions for concurrent systems, considering both linear time and branching time approaches.
A hierarchy of reverse bisimulations on stable configuration structures
The power of interleaving bisimulations is investigated and the relationships between them are represented as a hierarchy with IB at the bottom and H-H at the top, strengthening Bednarczyk's result that, in the absence of auto-concurrency, reverse IB is as strong as H- H bisimulation.
Transactions in RCCS
We propose a formalisation of the notion of transaction, using a variant of CCS, RCCS, that distinguishes reversible and irreversible actions, and incorporates a distributed backtrack mechanism. Any