Branching Pomsets for Choreographies

DOI10.4204/eptcs.365.3arXiv2208.04632OpenAlexW4290649661MaRDI QIDQ6122640

Luc Edixhoven, Guillermina Cledou, Sung-Shik Jongmans, José Proença

Publication date: 1 March 2024

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

Full work available at URL: https://arxiv.org/abs/2208.04632

Mathematics Subject Classification ID

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

Cites Work

• Modeling concurrency with partial orders
• Process algebra with action dependencies
• Realizability and verification of MSC graphs
• A core model for choreographic programming
• Realisability of pomsets
• Deadlock-freedom-by-design
• Introduction to Bisimulation and Coinduction
• Multiparty Asynchronous Session Types
• Multiparty asynchronous session types
• Event structure semantics for multiparty sessions

This page was built for publication: Branching Pomsets for Choreographies