Branching pomsets: design, expressiveness and applications to choreographies
From MaRDI portal
Publication:6151606
Cites work
- scientific article; zbMATH DE number 3821120 (Why is no real title available?)
- scientific article; zbMATH DE number 3995041 (Why is no real title available?)
- A calculus of communicating systems
- A core model for choreographic programming
- Algebraic laws for nondeterminism and concurrency
- Contextual Petri nets, asymmetric event structures, and processes
- Conversation protocols: a formalism for specification and verification of reactive electronic services
- Deadlock-freedom-by-design, multiparty asynchronous global programming
- Event structure semantics for multiparty sessions
- Exploring type-level bisimilarity towards more expressive multiparty session types
- Modeling concurrency with partial orders
- Multiparty Asynchronous Session Types
- Multiparty asynchronous session types
- On Communicating Finite-State Machines
- On series-parallel pomset languages: rationality, context-freeness and automata
- Parallel product of event structures
- Parameterised multiparty session types
- Petri nets, event structures and domains. I
- Process algebra with action dependencies
- Realisability of pomsets
- Realizability and verification of MSC graphs
- Reversible sessions with flexible choices
- The \(\pi\)-calculus: A theory of mobile processes
This page was built for publication: Branching pomsets: design, expressiveness and applications to choreographies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151606)