The correctness of concurrencies in (reversible) concurrent calculi
From MaRDI portal
Publication:6151611
DOI10.1016/j.jlamp.2023.100924OpenAlexW4318242601MaRDI QIDQ6151611
Publication date: 12 February 2024
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2023.100924
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversibility in the higher-order \(\pi\)-calculus
- Contextual equivalences in configuration structures and reversibility
- Models for concurrency: Towards a classification
- A calculus of communicating systems
- Non-interleaving semantics for mobile processes
- A brief history of process algebra
- From reversible semantics to reversible debugging
- Processes against tests: on defining contextual equivalences
- Concurrencies in reversible concurrent calculi
- An axiomatic approach to reversible computation
- Reversing algebraic process calculi
- Reversibility and Models for Concurrency
- Concurrency and Reversibility
- On the expressive power of recursion, replication and iteration in process calculi
- Causal Computational Complexity of Distributed Processes
- Towards a Truly Concurrent Semantics for Reversible CCS
- Forward-Reverse Observational Equivalences in CCSK
- Explicit Identifiers and Contexts in Reversible Concurrent Calculus
- A Compositional Semantics for the Reversible p-Calculus
- Perspectives of System Informatics
- Event structure semantics of (controlled) reversible CCS
This page was built for publication: The correctness of concurrencies in (reversible) concurrent calculi