On Nonlinear Prices in Timed Automata
Formal Languages and Automata Theory
2016-12-16 v1 Logic in Computer Science
Systems and Control
Abstract
Priced timed automata provide a natural model for quantitative analysis of real-time systems and have been successfully applied in various scheduling and planning problems. The optimal reachability problem for linearly-priced timed automata is known to be PSPACE-complete. In this paper we investigate priced timed automata with more general prices and show that in the most general setting the optimal reachability problem is undecidable. We adapt and implement the construction of Audemard, Cimatti, Kornilowicz, and Sebastiani for non-linear priced timed automata using state-of-the-art theorem prover Z3 and present some preliminary results.
Keywords
Cite
@article{arxiv.1612.04976,
title = {On Nonlinear Prices in Timed Automata},
author = {Devendra Bhave and Shankara Narayanan Krishna and Ashutosh Trivedi},
journal= {arXiv preprint arXiv:1612.04976},
year = {2016}
}
Comments
In Proceedings V2CPS-16, arXiv:1612.04023