Operational Semantics of Reversibility in Process Algebra

DOI10.1016/j.entcs.2005.12.095zbMath1316.68103OpenAlexW2012586948MaRDI QIDQ5262973

Iain Phillips, Irek Ulidowski

Publication date: 10 July 2015

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

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

zbMATH Keywords

process calculireversible computationSOS 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)

Related Items (2)

Reversibility in session-based concurrency: a fresh look ⋮ Reversible sessions with flexible choices

Cites Work

• Unnamed Item
• Unnamed Item
• Flow models of distributed computations: Three equivalent semantics for CCS
• A structural approach to operational semantics
• A structural approach to reversible computation
• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Operational Semantics of Reversibility in Process Algebra