Abstract
This paper shows how bounded model checking can be applied to parameter synthesis for parametric timed automata with continuous time. While it is known that the general problem is undecidable even for reachability, we show how to synthesize a part of the set of all the parameter valuations under which the given property holds in a model. The results form a full theory which can be easily applied to parametric verification of a wide range of temporal formulae – we present such an implementation for the existential part of CTL− X.
Partly supported by the Polish Ministry of Science and Higher Education.
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
Ábrahám, E., Herbstritt, M., Becker, B., Steffen, M.: Bounded model checking with parametric data structures. Electr. Notes Theor. Comput. Sci. 174(3), 3–16 (2007)
Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
Alur, R., Henzinger, T., Vardi, M.: Parametric real-time reasoning. In: Proc. of the 25th Ann. Symp. on Theory of Computing (STOC 1993), pp. 592–601. ACM (1993)
André, E., Chatain, T., Encrenaz, E., Fribourg, L.: An inverse method for parametric timed automata. International Journal of Foundations of Computer Science 20(5), 819–836 (2009)
Annichini, A., Bouajjani, A., Sighireanu, M.: TREX: A Tool for Reachability Analysis of Complex Systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 368–372. Springer, Heidelberg (2001)
Biere, A., Cimatti, A., Clarke, E., Strichman, O., Zhu, Y.: Bounded model checking. Advances in Computers 58, 118–149 (2003)
Blunno, I., Cortadella, J., Kondratyev, A., Lavagno, L., Lwin, K., Sotiriou, C.P.: Handshake protocols for de-synchronization. In: Proc. of 10th International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC 2004), pp. 149–158 (2004)
Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers 35(8), 677–691 (1986)
Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design 19(1), 7–34 (2001)
Dierks, H., Tapken, J.: Moby/DC - A Tool for Model-Checking Parametric Real-Time Specifications. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 271–277. Springer, Heidelberg (2003)
Doyen, L.: Robust parametric reachability for timed automata. Inf. Process. Lett. 102, 208–213 (2007)
Emerson, E.A., Clarke, E.: Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming 2(3), 241–266 (1982)
Frehse, G., Jha, S.K., Krogh, B.H.: A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 187–200. Springer, Heidelberg (2008)
Furber, S.B., Day, P.: Four-phase micropipeline latch control circuits. IEEE Trans. Very Large Scale Integr. Syst. 4, 247–253 (1996)
Henzinger, T., Ho, P., Wong-Toi, H.: HyTech: A Model Checker for Hybrid Systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 460–463. Springer, Heidelberg (1997)
Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.: Linear parametric model checking of timed automata. J. Log. Algebr. Program 52-53, 183–220 (2002)
Kacprzak, M., Nabiałek, W., Niewiadomski, A., Penczek, W., Półrola, A., Szreter, M., Woźna, B., Zbrzezny, A.: VerICS 2008 - a model checker for time Petri nets and high-level languages. In: Proc. of Int. Workshop on Petri Nets and Software Engineering (PNSE 2009), pp. 119–132. University of Hamburg (2009)
Li, R., Zhou, D., Du, D.: Satisfiability and integer programming as complementary tools. In: Proc. of the 2004 Asia and South Pacific Design Automation Conference, ASP-DAC 2004, pp. 879–882. IEEE Press, Piscataway (2004)
Penczek, W., Woźna, B., Zbrzezny, A.: Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae 51(1-2), 135–156 (2002)
Spelberg, R.L., De Rooij, R.C.H., Toetenel, W.J.: Application of parametric model checking - the root contention protocol using LPMC. In: Proc. of the 7th ASCI Conference, Beekbergen, The Netherlands, pp. 73–85 (Febuary 2000)
Srebrny, M., Stepień, L.: SAT as a programming environment for linear algebra. Fundamenta Informaticae 102, 115–127 (2010)
Stoelinga, M.: Fun with firewire: A comparative study of formal verification methods applied to the IEEE 1394 root contention protocol. Formal Asp. Comput. 14(3), 328–337 (2003)
Traonouez, L.-M., Lime, D., Roux, O.H.: Parametric Model Checking of Time Petri Nets with Stopwatches using the State-Class Graph. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 280–294. Springer, Heidelberg (2008)
Tripakis, S., Yovine, S.: Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design 18(1), 25–68 (2001)
Woźna, B., Zbrzezny, A.: Bounded model checking for the existential fragment of TCTL_G and diagonal timed automata. Fundamenta Informaticae 79(1-2), 229–256 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Knapik, M., Penczek, W. (2012). Bounded Model Checking for Parametric Timed Automata. In: Jensen, K., Donatelli, S., Kleijn, J. (eds) Transactions on Petri Nets and Other Models of Concurrency V. Lecture Notes in Computer Science, vol 6900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29072-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-29072-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29071-8
Online ISBN: 978-3-642-29072-5
eBook Packages: Computer ScienceComputer Science (R0)