Model Checking Timed Automata with One or Two Clocks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Model Checking Timed Automata with One or Two Clocks

Résumé

In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model checking TCTL and TCTL, over TAs with one clock or two clocks.\par First we show that the reachability problem is NLOGSPACE-complete for one clock TAs (i.e. as complex as reachability in classical graphs) and we give a polynomial time algorithm for model checking TCTL, over this class of TAs. Secondly we show that model checking becomes PSPACE-complete for full TCTL over one clock TAs. We also show that model checking CTL (without any timing constraint) over two clock TAs is PSPACE-complete and that reachability is NP-hard.
Fichier principal
Vignette du fichier
LMS-concur2004.pdf (206.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01194617 , version 1 (07-09-2015)

Identifiants

Citer

François Laroussinie, Nicolas Markey, Philippe Schnoebelen. Model Checking Timed Automata with One or Two Clocks. Proceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), 2004, London, UK, Unknown Region. pp.387-401, ⟨10.1007/978-3-540-28644-8_25⟩. ⟨hal-01194617⟩
89 Consultations
174 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More