Explicit Identifiers and Contexts in Reversible Concurrent Calculus

DOI10.1007/978-3-030-79837-6_9zbMath1476.68093arXiv2103.15623OpenAlexW3176727753MaRDI QIDQ5162607

Clément Aubert, Doriana Medić

Publication date: 3 November 2021

Published in: Reversible Computation (Search for Journal in Brave)

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

zbMATH Keywords

formal semanticsprocess algebrasprocess calculicontext for reversible calculi

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Other nonclassical models of computation (68Q09)

Related Items (5)

Replications in reversible concurrent calculi ⋮ Implementation of a reversible distributed calculus ⋮ The correctness of concurrencies in (reversible) concurrent calculi ⋮ Processes against tests: on defining contextual equivalences ⋮ Concurrencies in reversible concurrent calculi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contextual equivalences in configuration structures and reversibility
• A calculus of communicating systems
• Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
• Static versus dynamic reversibility in CCS
• An axiomatic approach to reversible computation
• A parametric framework for reversible \(\pi\)-calculi
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Domain equations for probabilistic processes
• Rigid Families for CCS and the $$\pi $$ -calculus
• Reversibility and Models for Concurrency
• Introduction to Bisimulation and Coinduction
• The Applied Pi Calculus
• Static VS Dynamic Reversibility in CCS
• A Distributed Pi-Calculus
• Behavioral theory for mobile ambients
• On Specifying Timeouts
• A Compositional Semantics for the Reversible p-Calculus
• CONCUR 2004 - Concurrency Theory
• Concurrent Flexible Reversibility
• Isomorphism theorems between models of mixed choice
• EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
• Causal Unfoldings
• CONCUR 2005 – Concurrency Theory
• Foundations of Software Science and Computation Structures
• Event structure semantics of (controlled) reversible CCS

This page was built for publication: Explicit Identifiers and Contexts in Reversible Concurrent Calculus