Towards generalised half-duplex systems

DOI10.4204/EPTCS.347.2MaRDI QIDQ6649540zbMATH OpenFDO

Authors Cinzia Di Giusto, Loïc Germerie Guizouarn, Etienne Lozes

Publication date 6 December 2024

Full work available at URL https://doi.org/10.4204/EPTCS.347.2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Multiparty half-duplex systems and synchronous communications
• Verification of programs with half-duplex communication
• Reachability problems in piecewise FIFO systems
• Verifying programs with unreliable channels
• Unreliable channels are easier to verify than perfect channels

Cites work

• Automated verification of automata communicating via FIFO and bag buffers
• Bounded MSC communication
• Context-Bounded Analysis of Concurrent Queue Systems
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• Multiparty Asynchronous Session Types
• Multiparty session types meet communicating automata
• On communicating automata with bounded channels
• On deciding synchronizability for asynchronously communicating systems
• On the k-synchronizability of systems
• On the completeness of verifying message passing programs under bounded asynchrony
• The Reachability Problem for Petri Nets Is Not Elementary
• Unreliable channels are easier to verify than perfect channels
• Verification of programs with half-duplex communication
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Verifying programs with unreliable channels

This page was built for publication: Towards generalised half-duplex systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649540)