Efficient Convex Zone Merging in Parametric Timed Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Efficient Convex Zone Merging in Parametric Timed Automata

Résumé

Parametric timed automata are a powerful formalism for reasoning on concurrent real-time systems with unknown or uncertain timing constants. Reducing their state space is a significant way to reduce the inherently large analysis times. We present here different merging reduction techniques based on convex union of constraints (parametric zones), allowing to decrease the number of states while preserving the correctness of verification and synthesis results. We perform extensive experiments, and identify the best heuristics in practice, bringing a significant decrease in the computation time on a benchmarks library.

Dates et versions

hal-03772708 , version 1 (08-09-2022)

Identifiants

Citer

Étienne André, Dylan Marinho, Laure Petrucci, Jaco van de Pol. Efficient Convex Zone Merging in Parametric Timed Automata. 20th International Conference on Formal Modeling and Analysis of Timed Systems, Sep 2022, Warsaw, Poland. pp.200-218, ⟨10.1007/978-3-031-15839-1_12⟩. ⟨hal-03772708⟩
31 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More