Realisability of pomsets

DOI10.1016/j.jlamp.2019.06.003zbMath1435.68213OpenAlexW2955586287MaRDI QIDQ2011200

Emilio Tuosto, Roberto Guanciale

Publication date: 28 November 2019

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

Full work available at URL: https://zenodo.org/record/3260605

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Branching Pomsets for Choreographies ⋮ Branching pomsets: design, expressiveness and applications to choreographies ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An abstract framework for choreographic testing ⋮ Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels

Cites Work

• Modeling concurrency with partial orders
• Verification of programs with half-duplex communication
• A Calculus of Global Interaction based on Session Types
• Multiparty Session Types Meet Communicating Automata
• Multiparty Asynchronous Session Types
• On Communicating Finite-State Machines
• Resolving Non-determinism in Choreographies
• CONCUR 2003 - Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Realisability of pomsets