Integer Parameter Synthesis for Timed Automata
We provide a subclass of parametric timed automata (PTA) that we can actually and efficiently analyze, and we argue that it retains most of the practical usefulness of PTA. The currently most useful known subclass of PTA, L/U automata, has a strong syntactical restriction for practical purposes, and we show that the associated theoretical results are mixed. We therefore advocate for a different restriction scheme: since in classical timed automata, real-valued clocks are always compared to integers for all practical purposes, we also search for parameter values as bounded integers. We show that the problem of the existence of parameter values such that some TCTL property is satisfied is PSPACE-complete. In such a setting, we can also of course synthesize all the values of parameters and we give symbolic algorithms, for reachability and unavoidability properties, to do it efficiently, i.e., without an explicit enumeration. This also has the practical advantage of giving the result as symbolic constraints between the parameters. We finally report on a few experimental results to illustrate the practical usefulness of the approach.
KeywordsSynthesis Problem Symbolic State Integer Parameter Time Automaton Parameter Valuation
Unable to display preview. Download preview PDF.
- 3.Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: ACM Symposium on Theory of Computing, pp. 592–601 (1993)Google Scholar
- 4.André, E., Chatain, T., Encrenaz, E., Fribourg, L.: An inverse method for parametric timed automata. In: RP Workshop on Reachability Problems, Liverpool, U.K., vol. 223, pp. 29–46 (2008)Google Scholar
- 10.Henzinger, T.A., Ho, P.-H., Wong-toi, H.: Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer 1, 460–463 (1997)Google Scholar
- 17.Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall (1967)Google Scholar