Timed Systems through the Lens of Logic - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Timed Systems through the Lens of Logic

Résumé

In this paper, we analyze timed systems with data structures. We start by describing behaviors of timed systems using graphs with timing constraints. Such a graph is called realizable if we can assign time-stamps to nodes or events so that they are consistent with the timing constraints. The logical definability of several graph properties [20], [10] has been a challenging problem, and we show, using a highly nontrivial argument, that the realizability property for collections of graphs with strict timing constraints is logically definable in a class of propositional dynamic logic (EQ-ICPDL), which is strictly contained in MSO. Using this result, we propose a novel, algorithmically efficient and uniform proof technique for the analysis of timed systems enriched with auxiliary data structures, like stacks and queues. Our technique unravels new results (for emptiness checking as well as model checking) for timed systems with richer features than considered so far, while also recovering existing results.
Fichier principal
Vignette du fichier
2019-Timed Systems through the Lens of Logic.pdf (575.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03185736 , version 1 (30-03-2021)

Identifiants

Citer

S. Akshay, Paul Gastin, Vincent Juge, Shankara Narayanan Krishna. Timed Systems through the Lens of Logic. 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2019, Vancouver, Canada. ⟨10.1109/LICS.2019.8785684⟩. ⟨hal-03185736⟩
47 Consultations
45 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More