Concurrent flexible reversibility
From MaRDI portal
Publication:5326296
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(35)- Towards bridging time and causal reversibility
- Reversible computation in nets with bonds
- Specifying reversibility with \(\mathrm{TLA}^+\)
- Reversibility in the higher-order \(\pi\)-calculus
- Concurrencies in reversible concurrent calculi
- Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
- Towards a taxonomy for reversible computation approaches
- Towards modelling of local reversibility
- Semantics of concurrent revisions
- Reversible sessions with flexible choices
- Static versus dynamic reversibility in CCS
- Reversibility in session-based concurrency: a fresh look
- Static VS Dynamic Reversibility in CCS
- Explicit Identifiers and Contexts in Reversible Concurrent Calculus
- Reversibility and asymmetric conflict in event structures
- Quantitative Analysis of Concurrent Reversible Computations
- Modular rollback through control logging: a pair of twin functional pearls
- Replication, refinement \& reachability: complexity in dynamic condition-response graphs
- Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications
- scientific article; zbMATH DE number 7447776 (Why is no real title available?)
- Reversibility in massive concurrent systems
- Checkpoint/rollback vs causally-consistent reversibility
- On reversibility and broadcast
- A reversible perspective on Petri nets and event structures
- Model checking reversible systems: forwardly
- A collective interpretation semantics for reversing Petri nets
- Reversibility and Predictions
- Processes, systems \& tests: defining contextual equivalences
- On system rollback and totalized fields: an algebraic approach to system change
- Branching bisimulation semantics enables noninterference analysis of reversible systems
- Causal reversibility for timed process calculi with lazy/eager durationless actions and time additivity
- Causal-consistent rollback in a tuple-based language
- Processes against tests: on defining contextual equivalences
- Causal reversibility implies time reversibility
- Reversible multiparty sessions with checkpoints
This page was built for publication: Concurrent flexible reversibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326296)