Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
Abstract elided by the publisher.
Related papers
- Verifying Asynchronous Interactions via Communicating Session Automata CAV 2019
- Testing consensus implementations using communication closure OOPSLA 2020
- Verifying Indistinguishability of Privacy-Preserving Protocols OOPSLA 2023
- Compositional Abstraction for Timed Systems with Broadcast Synchronization CAV 2025
- Verifying Quantum Circuits with Level-Synchronized Tree Automata POPL 2025
- Synchronization via scheduling: techniques for efficiently managing shared state PLDI 2011
- More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms PPoPP 2015
- Static Trace-Based Deadlock Analysis for Synchronous Mini-Go APLAS 2016