On the \(k\)-synchronizability of systems

DOI10.1007/978-3-030-45231-5_9OpenAlexW3001971291MaRDI QIDQ2200819

Etienne Lozes, Cinzia Di Giusto, Laetitia Laversa

Publication date: 23 September 2020

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

zbMATH Keywords

verificationsynchronous communicationcommunicating automataasychronous

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (7)

Guessing the Buffer Bound for k-Synchronizability ⋮ Multiparty half-duplex systems and synchronous communications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An abstract framework for choreographic testing ⋮ Non axiomatisability of positive relation algebras with constants, via graph homomorphisms ⋮ 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
• Automated verification of automata communicating via FIFO and bag buffers
• Synchronizability for Verification of Asynchronously Communicating Systems
• Analysis of Communicating Automata
• A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
• Reduction
• Computer Aided Verification
• Context-Bounded Analysis of Concurrent Queue Systems
• On the completeness of verifying message passing programs under bounded asynchrony

This page was built for publication: On the \(k\)-synchronizability of systems