Guessing the Buffer Bound for k-Synchronizability

DOI10.1142/s0129054122430018MaRDI QIDQ6070755

Etienne Lozes, Laetitia Laversa, Cinzia Di Giusto

Publication date: 24 November 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

synchronizabilityMSCcommunicating automata

Mathematics Subject Classification ID

Computer system organization (68Mxx) Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On deciding synchronizability for asynchronously communicating systems
• Decomposition of distributed programs into communication-closed layers
• Verifying programs with unreliable channels
• Guessing the buffer bound for k-synchronizability
• On the \(k\)-synchronizability of systems
• Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues
• A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
• On Communicating Finite-State Machines
• Reduction
• Synchronous, asynchronous, and causally ordered communication
• Context-Bounded Analysis of Concurrent Queue Systems
• On the completeness of verifying message passing programs under bounded asynchrony

This page was built for publication: Guessing the Buffer Bound for k-Synchronizability