Model-Checking One-Clock Priced Timed Automata

Patricia Bouyer (1) , Kim Guldstrand Larsen (2) , Nicolas Markey (1)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 CISS - Center for Indlejrede Software Systemer

We consider the model of priced (a.k.a.~weighted) timed automata, an extension of timed automata with cost information on both locations and transitions. We prove that model-checking this class of models against the logic~WCTL, CTL~with cost-constrained modalities, is PSPACE-complete under the "single-clock" assumption. In~contrast, it~has been recently proved that the model-checking problem is undecidable for this model as soon as the system has three clocks. We also prove that the model-checking of~WCTL becomes undecidable, even under this "single-clock" assumption.

Domaines: Logique en informatique [cs.LO]

Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey. Model-Checking One-Clock Priced Timed Automata. Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'07), 2007, Braga, Portugal. pp.108-122, ⟨10.1007/978-3-540-71389-0_9⟩. ⟨hal-01194603⟩