Pages that link to "Item:Q2573635"
From MaRDI portal
The following pages link to Verification of programs with half-duplex communication (Q2573635):
Displaying 21 items.
- Relating two automata-based models of orchestration and choreography (Q272310) (← links)
- On deciding synchronizability for asynchronously communicating systems (Q344799) (← links)
- Automated verification of automata communicating via FIFO and bag buffers (Q1650866) (← links)
- On the boundary between decidability and undecidability of asynchronous session subtyping (Q1704600) (← links)
- Realisability of pomsets (Q2011200) (← links)
- Connecting open systems of communicating finite state machines (Q2011202) (← links)
- An abstract framework for choreographic testing (Q2239278) (← links)
- Multiparty half-duplex systems and synchronous communications (Q2683034) (← links)
- Synchronizability for Verification of Asynchronously Communicating Systems (Q2891401) (← links)
- Honesty by Typing (Q2974791) (← links)
- On the Undecidability of Asynchronous Session Subtyping (Q2988385) (← links)
- Compliance in Behavioural Contracts: A Brief Survey (Q3460865) (← links)
- (Q4600773) (← links)
- (Q5019694) (← links)
- (Q5028474) (← links)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms (Q5089316) (← links)
- (Q5111454) (← links)
- (Q5129947) (← links)
- Verification of Flat FIFO Systems (Q5875373) (← links)
- Composition of synchronous communicating systems (Q6052940) (← links)
- On Composing Communicating Systems (Q6122641) (← links)
