Guessing the buffer bound for k-synchronizability

DOI10.1007/978-3-030-79121-6_9MaRDI QIDQ2117668zbMATH OpenOpenAlexFDO

Authors Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes

Publication date 22 March 2022

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

zbMATH Keywords

communicating automataMSCsynchronizability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
• Context-Bounded Analysis of Concurrent Queue Systems
• Decomposition of distributed programs into communication-closed layers
• scientific article; zbMATH DE number 5286864 (Why is no real title available?)
• On Communicating Finite-State Machines
• On deciding synchronizability for asynchronously communicating systems
• On the k-synchronizability of systems
• On the completeness of verifying message passing programs under bounded asynchrony
• Reduction
• Synchronizing the asynchronous
• Verifying programs with unreliable channels

Cited in

(1)

• Guessing the Buffer Bound for k-Synchronizability

This page was built for publication: Guessing the buffer bound for k-synchronizability

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