Abstract
Keeping the state space small is essential when verifying real-time systems using Timed Automata (TA). In the model-checker Uppaal, the merging operation has been used extensively in order to reduce the number of states. Actually, Uppaal’s merging technique applies within the more general setting of Parametric Timed Automata (PTA). The Inverse Method (IM) for a PTA \(\mathcal{A}\) is a procedure that synthesizes a zone around a given point π 0 (parameter valuation) over which \(\mathcal{A}\) is guaranteed to behave in an equivalent time-abstract manner. We show that the integration of merging into IM leads to the synthesis of larger zones around π 0. It also often improves the performance of IM, both in terms of computational space and time, as shown by our experimental results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdeddaïm, Y., Maler, O.: Job-Shop Scheduling Using Timed Automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 478–492. Springer, Heidelberg (2001)
André, É., Chatain, T., Encrenaz, E., Fribourg, L.: An inverse method for parametric timed automata. IJFCS 20(5), 819–836 (2009)
André, É., Soulat, R.: Synthesis of Timing Parameters Satisfying Safety Properties. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 31–44. Springer, Heidelberg (2011)
André, É.: IMITATOR II: A tool for solving the good parameters problem in timed automata. In: INFINITY, pp. 91–99 (2010)
André, É.: An Inverse Method for the Synthesis of Timing Parameters in Concurrent Systems. Thèse de doctorat, ENS Cachan, France (2010)
Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Science of Computer Programming 72(1–2), 3–21 (2008)
David, A.: Merging DBMs efficiently. In: 17th Nordic Workshop on Programming Theory, pp. 54–56. DIKU, University of Copenhagen (2005)
David, A.: Uppaal DBM Library Programmer’s Reference (2006), http://people.cs.aau.dk/~adavid/UDBM/manual-061023.pdf
Henzinger, T.A., Ho, P.H., Wong-Toi, H.: A user guide to HyTech. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 41–71. Springer, Heidelberg (1995)
Markey, N.: Robustness in real-time systems. In: SIES 2011, Sweden, pp. 28–34. IEEE Computer Society Press (2011)
Salah, R.B., Bozga, M., Maler, O.: On Interleaving in Timed Automata. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 465–476. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
André, É., Fribourg, L., Soulat, R. (2012). Enhancing the Inverse Method with State Merging. In: Goodloe, A.E., Person, S. (eds) NASA Formal Methods. NFM 2012. Lecture Notes in Computer Science, vol 7226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28891-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-28891-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28890-6
Online ISBN: 978-3-642-28891-3
eBook Packages: Computer ScienceComputer Science (R0)