Unreliability in practical subclasses of communicating systems
From MaRDI portal
Cites work
- Counterexample guided synthesis of monitors for realizability enforcement
- Crash-stop failures in asynchronous multiparty session types
- Developments in Language Theory
- From communicating machines to graphical choreographies
- Generalised multiparty session types with crash-stop failures
- scientific article; zbMATH DE number 2087438 (Why is no real title available?)
- scientific article; zbMATH DE number 7730616 (Why is no real title available?)
- Multiparty asynchronous session types
- Multiparty compatibility in communicating automata: characterisation and synthesis of global session types
- Multiparty half-duplex systems and synchronous communications
- On communicating automata with bounded channels
- On Communicating Finite-State Machines
- On the k-synchronizability of systems
- On the completeness of verifying message passing programs under bounded asynchrony
- Propositional dynamic logic for message-passing systems
- Session types for link failures
- The impossibility of implementing reliable communication in the face of crashes
- The Reachability Problem for Petri Nets Is Not Elementary
- Tools and algorithms for the construction and analysis of systems. 28th international conference, TACAS 2022, held as part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2--7, 2022. Proceedings. Pa
- Verification of programs with half-duplex communication
- Verifying asynchronous interactions via communicating session automata
- Verifying lossy channel systems has nonprimitive recursive complexity.
This page was built for publication: Unreliability in practical subclasses of communicating systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391933)