Communication Dans Un Congrès Année : 2022

An Efficient State Space Construction for a Class of Timed Automata

Résumé

In this paper we propose a timed abstraction, called acceleration, for the analysis of NCTAs, a class of networks of timed automata tailored to model systems composed out of non-deterministic cyclic agents updating shared variables. The abstraction is based on “maximal action zones”, easy to compute on the fly, which generally aggregate regions in a different way than classical zones do. The original and accelerated semantics are shown coherent in the sense that they both lead to the same untimed semantics, and satisfy the same class of positive reachability queries.
Fichier non déposé

Dates et versions

hal-04307762 , version 1 (26-11-2023)

Identifiants

Citer

Johan Arcile, Raymond Devillers, Hanna Klaudel. An Efficient State Space Construction for a Class of Timed Automata. 43rd International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2022), Jun 2022, Bergen, Norway. pp.246--263, ⟨10.1007/978-3-662-68191-6_10⟩. ⟨hal-04307762⟩
69 Consultations
0 Téléchargements

Altmetric

Partager

More