A verification technique for reversible process algebra
DOI10.1007/978-3-642-36315-3_17zbMATH Open1451.68177OpenAlexW942901085MaRDI QIDQ3453753FDOQ3453753
Authors: 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
Recommendations
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)
Cites Work
- Event structure semantics of parallel extrusion in the pi-calculus
- Controlling Reversibility in Higher-Order Pi
- Reversing Higher-Order Pi
- Typed event structures and the linear \(\pi \)-calculus
- Self-assembling trees
- Reversibility and models for concurrency
- Well-behaved flow event structures for parallel composition and action refinement
Cited In (7)
- Static versus dynamic reversibility in CCS
- Static VS Dynamic Reversibility in CCS
- Towards a Truly Concurrent Semantics for Reversible CCS
- Title not available (Why is that?)
- Forward-reverse observational equivalences in CCSK
- Causal reversibility for timed process calculi with lazy/eager durationless actions and time additivity
- Modeling and verification of reconfigurable printing system based on process algebra
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)