Guessing the buffer bound for k-synchronizability

DOI10.1007/978-3-030-79121-6_9OpenAlexW3173280383MaRDI QIDQ2117668

Laetitia Laversa, Etienne Lozes, Cinzia Di Giusto

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2104.14408

zbMATH Keywords

synchronizabilityMSCcommunicating automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Guessing the Buffer Bound for k-Synchronizability

Cites Work

• 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
• On the \(k\)-synchronizability of systems
• A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
• On Communicating Finite-State Machines
• Reduction
• 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