Realisability of pomsets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1701776 (Why is no real title available?)
- scientific article; zbMATH DE number 4074504 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1927562 (Why is no real title available?)
- A calculus of global interaction based on session types
- An abstract semantics of the global view of choreographies
- CONCUR 2003 - Concurrency Theory
- Modeling concurrency with partial orders
- Multiparty Asynchronous Session Types
- Multiparty session types meet communicating automata
- On Communicating Finite-State Machines
- Resolving non-determinism in choreographies
- The -calculus: A theory of mobile processes
- Verification of programs with half-duplex communication
Cited in
(8)- Branching pomsets: design, expressiveness and applications to choreographies
- scientific article; zbMATH DE number 7471661 (Why is no real title available?)
- Computing a poset from its realizer
- An abstract framework for choreographic testing
- An abstract framework for choreographic testing
- scientific article; zbMATH DE number 7471686 (Why is no real title available?)
- Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels
- Branching Pomsets for Choreographies
This page was built for publication: Realisability of pomsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011200)