Compositional Abstraction for Timed Systems with Broadcast Synchronization
By: Hanyue Chen, Miaomiao Zhang, Frits Vaandrager
Potential Business Impact:
Helps check complex computer programs faster.
Simulation-based compositional abstraction effectively mitigates state space explosion in model checking, particularly for timed systems. However, existing approaches do not support broadcast synchronization, an important mechanism for modeling non-blocking one-to-many communication in multi-component systems. Consequently, they also lack a parallel composition operator that simultaneously supports broadcast synchronization, binary synchronization, shared variables, and committed locations. To address this, we propose a simulation-based compositional abstraction framework for timed systems, which supports these modeling concepts and is compatible with the popular UPPAAL model checker. Our framework is general, with the only additional restriction being that the timed automata are prohibited from updating shared variables when receiving broadcast signals. Through two case studies, our framework demonstrates superior verification efficiency compared to traditional monolithic methods.
Similar Papers
Practical Abstractions for Model Checking Continuous-Time Multi-Agent Systems
Multiagent Systems
Checks if real-time computer systems work right.
Compositional Active Learning of Synchronizing Systems through Automated Alphabet Refinement
Machine Learning (CS)
Learns how many parts work together automatically.
On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions
Logic in Computer Science
Checks complex systems work correctly, faster.