English

Compositional Abstraction for Timed Systems with Broadcast Synchronization

Formal Languages and Automata Theory 2025-05-20 v1

Abstract

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.

Keywords

Cite

@article{arxiv.2505.12436,
  title  = {Compositional Abstraction for Timed Systems with Broadcast Synchronization},
  author = {Hanyue Chen and Miaomiao Zhang and Frits Vaandrager},
  journal= {arXiv preprint arXiv:2505.12436},
  year   = {2025}
}

Comments

Extended version of the paper accepted to CAV 2025. This version includes complete proofs and additional details on the experiments

R2 v1 2026-07-01T02:19:50.217Z