A verification technique for reversible process algebra
From MaRDI portal
Recommendations
Cites work
- Controlling Reversibility in Higher-Order Pi
- Event structure semantics of parallel extrusion in the pi-calculus
- Reversibility and models for concurrency
- Reversing Higher-Order Pi
- Self-assembling trees
- Typed event structures and the linear \(\pi \)-calculus
- Well-behaved flow event structures for parallel composition and action refinement
Cited in
(12)- Modeling and verification of reconfigurable printing system based on process algebra
- Static versus dynamic reversibility in CCS
- Static VS Dynamic Reversibility in CCS
- Towards a Truly Concurrent Semantics for Reversible CCS
- Forward-reverse observational equivalences in CCSK
- scientific article; zbMATH DE number 5181778 (Why is no real title available?)
- Causal reversibility for timed process calculi with lazy/eager durationless actions and time additivity
- Causal reversibility in nondeterministic process calculi extended with time or probabilities
- Alternative characterizations of hereditary history-preserving bisimilarity via backward ready multisets
- Expansion laws for forward-reverse, forward, and reverse bisimilarities via proved encodings
- Reversibility in process calculi with nondeterminism and probabilities
- A truly concurrent semantics for reversible CCS
This page was built for publication: A verification technique for reversible process algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453753)