A Verification Technique for Reversible Process Algebra

DOI10.1007/978-3-642-36315-3_17zbMath1451.68177OpenAlexW942901085MaRDI QIDQ3453753

Jean Krivine

Publication date: 30 November 2015

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36315-3_17

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Static VS Dynamic Reversibility in CCS ⋮ Towards a Truly Concurrent Semantics for Reversible CCS ⋮ Forward-Reverse Observational Equivalences in CCSK ⋮ Static versus dynamic reversibility in CCS

Cites Work

• Typed event structures and the linear \(\pi \)-calculus
• Well-behaved flow event structures for parallel composition and action refinement
• Self-assembling Trees
• Reversibility and Models for Concurrency
• Event Structure Semantics of Parallel Extrusion in the Pi-Calculus
• Controlling Reversibility in Higher-Order Pi
• Reversing Higher-Order Pi

This page was built for publication: A Verification Technique for Reversible Process Algebra