Score: 0

Compositional Abstraction for Timed Systems with Broadcast Synchronization

Published: May 18, 2025 | arXiv ID: 2505.12436v1

By: Hanyue Chen, Miaomiao Zhang, Frits Vaandrager

Potential Business Impact:

Helps check complex computer programs faster.

Business Areas:
Simulation Software

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.

Country of Origin
🇳🇱 Netherlands

Page Count
38 pages

Category
Computer Science:
Formal Languages and Automata Theory