Branching bisimulation semantics enables noninterference analysis of reversible systems
From MaRDI portal
Publication:6535463
DOI10.1007/978-3-031-35355-0_5zbMATH Open1543.68244MaRDI QIDQ6535463
Marco Bernardo, Andrea Esposito, Alessandro Aldini
Publication date: 11 January 2024
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cauder: a causal-consistent reversible debugger for Erlang
- Reversing steps in membrane systems computations
- Checkpoint/rollback vs causally-consistent reversibility
- Analysis of security protocols as open systems
- Classification of security properties in a Linda-like process algebra
- Reversing algebraic process calculi
- Reverse Code Generation for Parallel Discrete Event Simulation
- Up-to Techniques for Branching Bisimilarity
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- Communicating Transactions
- Irreversibility and Heat Generation in the Computing Process
- A Theory of Communicating Sequential Processes
- Formal verification of parallel programs
- Branching time and abstraction in bisimulation semantics
- Persistent Stochastic Non-Interference
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems
- CONCUR 2004 - Concurrency Theory
- Concurrent Flexible Reversibility
- Logical Reversibility of Computation
- CONCUR 2005 – Concurrency Theory
This page was built for publication: Branching bisimulation semantics enables noninterference analysis of reversible systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535463)
