Operational semantics of reversibility in process algebra

DOI10.1016/J.ENTCS.2005.12.095zbMATH Open1316.68103OpenAlexW2012586948MaRDI QIDQ5262973FDOQ5262973

Authors: 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

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

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)

Cites Work

• A structural approach to operational semantics
• A structural approach to reversible computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• Flow models of distributed computations: Three equivalent semantics for CCS

Cited In (6)

• Reversible sessions with flexible choices
• Foundations of Software Science and Computation Structures
• Reversibility in session-based concurrency: a fresh look
• Title not available (Why is that?)
• Reversing algebraic process calculi
• Title not available (Why is that?)

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)