Reversible computations are computations
From MaRDI portal
Cites work
- A compositional semantics for the reversible -calculus
- A distributed operational view of reversible prime event structures
- A fully abstract semantics for causality in the \(\pi\)-calculus
- A hierarchy of reverse bisimulations on stable configuration structures
- A new operation on partially ordered sets.
- A structural approach to reversible computation
- A truly concurrent semantics for reversible CCS
- An axiomatic theory for reversible computation
- Cauder: a causal-consistent reversible debugger for Erlang
- CONCUR 2004 - Concurrency Theory
- CONCUR 2005 – Concurrency Theory
- Configuration structures, event structures and Petri nets
- Controlling Reversibility in Higher-Order Pi
- Event structure semantics of (controlled) reversible CCS
- Formal techniques for distributed systems. Joint 14th IFIP WG 6.1 international conference, FMOODS 2012 and 32nd IFIP WG 6.1 international conference, FORTE 2012, Stockholm, Sweden, June 13--16, 2012. Proceedings
- Forward-reverse observational equivalences in CCSK
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 3821120 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 107643 (Why is no real title available?)
- scientific article; zbMATH DE number 1754652 (Why is no real title available?)
- scientific article; zbMATH DE number 3995041 (Why is no real title available?)
- scientific article; zbMATH DE number 4119615 (Why is no real title available?)
- scientific article; zbMATH DE number 7559463 (Why is no real title available?)
- scientific article; zbMATH DE number 7297883 (Why is no real title available?)
- Minimal transition systems for history-preserving bisimulation
- Petri nets, event structures and domains. I
- Proceedings of the 13th international workshop on expressiveness in concurrency (EXPRESS 2006), Bonn, Germany, August 26, 2006
- Reversibility and asymmetric conflict in event structures
- Reversing Higher-Order Pi
- Rigid families for the reversible -calculus
- Static versus dynamic reversibility in CCS
- The correctness of concurrencies in (reversible) concurrent calculi
This page was built for publication: Reversible computations are computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312191)