Operational semantics of reversibility in process algebra

DOI10.1016/J.ENTCS.2005.12.095MaRDI QIDQ5262973zbMATH OpenOpenAlexFDO

Authors Iain Phillips, Irek Ulidowski

Publication date 10 July 2015

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.entcs.2005.12.095

zbMATH Keywords

reversible computationprocess calculiSOS rules

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Foundations of Software Science and Computation Structures
• Reversing algebraic process calculi
• Reversibility and models for concurrency
• Concurrency and reversibility
• Reversible computation in Petri nets

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• A structural approach to operational semantics
• A structural approach to reversible computation
• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• Flow models of distributed computations: Three equivalent semantics for CCS

Cited in

(6)

• scientific article; zbMATH DE number 937812 (Why is no real title available?)
• Foundations of Software Science and Computation Structures
• Reversing algebraic process calculi
• Reversibility in session-based concurrency: a fresh look
• Reversible sessions with flexible choices
• scientific article; zbMATH DE number 139606 (Why is no real title available?)

This page was built for publication: Operational semantics of reversibility in process algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262973)