scientific article; zbMATH DE number 7559463
From MaRDI portal
Publication:5089270
DOI10.4230/LIPIcs.CONCUR.2020.7MaRDI QIDQ5089270
Ioana Cristescu, Clément Aubert
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2005.06814
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
formal semanticsbisimulationreversible CCSconfiguration structuresdistributed and reversible computationprocess algebras and calculi
Related Items
Behavioural logics for configuration structures, Implementation of a reversible distributed calculus, Forward-Reverse Observational Equivalences in CCSK, Processes against tests: on defining contextual equivalences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On reversible Turing machines and their function universality
- Contextual equivalences in configuration structures and reversibility
- Models for concurrency: Towards a classification
- Configuration structures, event structures and Petri nets
- Foundations of generalized reversible computing
- Reversible nondeterministic finite automata
- Reversible computation in Petri nets
- Bisimulation from open maps
- Static versus dynamic reversibility in CCS
- Reversing algebraic process calculi
- Rigid Families for CCS and the $$\pi $$ -calculus
- Hereditary History-Preserving Bisimilarity: Logics and Automata
- Reversibility and Models for Concurrency
- Quantum Computation and Quantum Information
- Reversing Higher-Order Pi
- A Compositional Semantics for the Reversible p-Calculus
- CONCUR 2004 - Concurrency Theory
- Bisimulations for Communicating Transactions
- A Logic for True Concurrency
- Event Identifier Logic
- CONCUR 2005 – Concurrency Theory
- Foundations of Software Science and Computation Structures
- Event structure semantics of (controlled) reversible CCS
- Refinement of actions and equivalence notions for concurrent systems
- Reversing Steps in Petri Nets
