Input urgent semantics for asynchronous timed session types
From MaRDI portal
Publication:2329441
DOI10.1016/j.jlamp.2019.04.001zbMath1431.68078OpenAlexW2948426653WikidataQ127752384 ScholiaQ127752384MaRDI QIDQ2329441
Publication date: 17 October 2019
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2019.04.001
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On deciding synchronizability for asynchronously communicating systems
- Verifiable abstractions for contract-oriented systems
- A theory of timed automata
- Timed runtime monitoring for multiparty conversations
- Input urgent semantics for asynchronous timed session types
- From Communicating Machines to Graphical Choreographies
- On the Undecidability of Asynchronous Session Subtyping
- Multiparty Asynchronous Session Types
- A theory of contracts for web services
- A Semantic Deconstruction of Session Types
- Timed Multiparty Session Types
- On Communicating Finite-State Machines
- Progress-preserving Refinements of CTA
- Meeting Deadlines Together
- Formal Methods for the Design of Real-Time Systems
- Sub-behaviour relations for session-based client/server systems
- Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
- On the completeness of verifying message passing programs under bounded asynchrony