Foundations of Software Science and Computation Structures

DOI10.1007/11690634zbMATH Open1180.68197OpenAlexW2504714231MaRDI QIDQ5899092FDOQ5899092

Irek Ulidowski, Iain Phillips

Publication date: 2 May 2007

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

Full work available at URL: https://doi.org/10.1007/11690634

Recommendations

• Reversing algebraic process calculi
• Operational semantics of reversibility in process algebra
• Reversibility and models for concurrency
• CONCUR 2004 - Concurrency Theory
• Reversing Higher-Order Pi

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (20)

• Reversible computation in nets with bonds
• CONCUR 2004 - Concurrency Theory
• An axiomatic approach to reversible computation
• Implementation of a reversible distributed calculus
• SOS formats and meta-theory: 20 years after
• Self-assembling trees
• Reversibility and models for concurrency
• Towards a categorical representation of reversible event structures
• Title not available (Why is that?)
• Explicit Identifiers and Contexts in Reversible Concurrent Calculus
• Towards Modelling of Local Reversibility
• Modelling of DNA mismatch repair with a reversible process calculus
• Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications
• Reversing algebraic process calculi
• A Calculus for Local Reversibility
• Compositional reversible computation
• General reversibility
• Processes, systems \& tests: defining contextual equivalences
• An axiomatic theory for reversible computation
• Processes against tests: on defining contextual equivalences

This page was built for publication: Foundations of Software Science and Computation Structures

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