Contextual equivalences in configuration structures and reversibility

DOI10.1016/j.jlamp.2016.08.004zbMath1353.68193arXiv1511.05750OpenAlexW2963245642MaRDI QIDQ347363

Clément Aubert, Ioana Cristescu

Publication date: 30 November 2016

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.05750

zbMATH Keywords

formal semanticsprocess algebrasprocess calculicontextual characterizationhereditary history-preserving bisimulationreversible CCSstrong barbed congruence

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

Towards a categorical representation of reversible event structures ⋮ The correctness of concurrencies in (reversible) concurrent calculi ⋮ Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures ⋮ Unnamed Item ⋮ Forward-Reverse Observational Equivalences in CCSK ⋮ Explicit Identifiers and Contexts in Reversible Concurrent Calculus ⋮ Static versus dynamic reversibility in CCS ⋮ Unnamed Item ⋮ Event structure semantics of (controlled) reversible CCS ⋮ Event structures for the reversible early internal \(\pi\)-calculus ⋮ Concurrencies in reversible concurrent calculi

Cites Work

• Bisimulation and action refinement
• Configuration structures, event structures and Petri nets
• On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
• On reduction-based process semantics
• Bisimulation from open maps
• Reversing algebraic process calculi
• Self-assembling Trees
• Reversibility and Models for Concurrency
• A hierarchy of reverse bisimulations on stable configuration structures
• Reversing Higher-Order Pi
• Barbed bisimulation
• A Compositional Semantics for the Reversible p-Calculus
• CONCUR 2004 - Concurrency Theory
• A Logic for True Concurrency
• CONCUR 2005 – Concurrency Theory
• Refinement of actions and equivalence notions for concurrent systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Contextual equivalences in configuration structures and reversibility