Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels

DOI10.1016/J.JLAMP.2020.100560zbMath1451.68191OpenAlexW3026610525MaRDI QIDQ780055

Monika Kapus-Kolar

Publication date: 14 July 2020

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2020.100560

zbMATH Keywords

realizabilitysemanticschoreographycausal-consistent reversibilitycommunicating state machinespomset

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 (1)

Unnamed Item

Uses Software

• CauDEr

Cites Work

• Unnamed Item
• Cauder: a causal-consistent reversible debugger for Erlang
• From reversible semantics to reversible debugging
• Realisability of pomsets
• From Communicating Machines to Graphical Choreographies
• A Calculus of Global Interaction based on Session Types
• On Communicating Finite-State Machines

This page was built for publication: Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels