Abstract
Safety properties are crucial when verifying real-time concurrent systems. When reasoning parametrically, i.e., with unknown constants, it is of high interest to infer a set of parameter valuations consistent with such safety properties. We present here algorithms based on the inverse method for parametric timed automata: given a reference parameter valuation, it infers a constraint such that, for any valuation satisfying this constraint, the discrete behavior of the system is the same as under the reference valuation in terms of traces, i.e., alternating sequences of locations and actions. These algorithms do not guarantee the equality of the trace sets, but are significantly quicker, synthesize larger sets of parameter valuations than the original method, and still preserve various properties including safety (i.e., non-reachability) properties. Those algorithms have been implemented in imitator and applied to various examples of asynchronous circuits and communication protocols.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Annichini, A., Asarin, E., Bouajjani, A.: Symbolic techniques for parametric reasoning about counter and clock systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 419–434. Springer, Heidelberg (2000)
André, É., 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)
Alur, R., Dill, D.L.: A theory of timed automata. TCS 126(2), 183–235 (1994)
André, É., Fribourg, L.: Behavioral cartography of timed automata. In: Kučera, A., Potapov, I. (eds.) RP 2010. LNCS, vol. 6227, pp. 76–90. Springer, Heidelberg (2010)
André, É., Fribourg, L., Sproston, J.: An extension of the inverse method to probabilistic timed automata. In: AVoCS 2009. Electronic Communications of the EASST, vol. 23 (2009)
Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: STOC 1993, pp. 592–601. ACM, New York (1993)
Alur, R., Kanade, A., Ramesh, S., Shashidhar, K.C.: Symbolic analysis for improving simulation coverage of simulink/stateflow models. In: EMSOFT 2008, pp. 89–98. ACM, New York (2008)
André, É.: IMITATOR II: A tool for solving the good parameters problem in timed automata. In: INFINITY 2010. EPTCS, vol. 39, pp. 91–99 (2010)
André, É.: An Inverse Method for the Synthesis of Timing Parameters in Concurrent Systems. Ph.d. thesis, Laboratoire Spécification et Vérification, ENS Cachan, France (2010)
André, É., Soulat, R.: Synthesis of timing parameters satisfying safety properties (full version). Research report, Laboratoire Spécification et Vérification, ENS Cachan, France (2011), http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2011-13.pdf
Clarisó, R., Cortadella, J.: The octahedron abstract domain. Sci. Comput. Program. 64(1), 115–139 (2007)
Chaki, S., Clarke, E.M., Ouaknine, J., Sharygina, N., Sinha, N.: State/event-based software model checking. In: Boiten, E.A., Derrick, J., Smith, G.P. (eds.) IFM 2004. LNCS, vol. 2999, pp. 128–147. Springer, Heidelberg (2004)
Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154–169. Springer, Heidelberg (2000)
Collomb–Annichini, A., Sighireanu, M.: Parameterized reachability analysis of the IEEE 1394 Root Contention Protocol using TReX. In: RT-TOOLS 2001 (2001)
D’Argenio, P.R., Katoen, J.P., Ruys, T.C., Tretmans, G.J.: The bounded retransmission protocol must be on time! In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, Springer, Heidelberg (1997)
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)
Fribourg, L., Kühne, U.: Parametric verification and test coverage for hybrid automata using the inverse method. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 191–204. Springer, Heidelberg (2011)
Holzmann, G.: The Spin model checker: primer and reference manual. Addison-Wesley Professional, Reading (2003)
Hune, T.S., Romijn, J.M.T., Stoelinga, M.I.A., Vaandrager, F.W.: Linear parametric model checking of timed automata. Journal of Logic and Algebraic Programming (2002)
Jha, S.K., Krogh, B.H., Weimer, J.E., Clarke, E.M.: Reachability for linear hybrid automata using iterative relaxation abstraction. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 287–300. Springer, Heidelberg (2007)
Knapik, M., Penczek, W.: Bounded model checking for parametric time automata. In: SUMo 2010 (2010)
Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1(1-2), 134–152 (1997)
Pnueli, A.: The temporal logic of programs. In: SFCS 1977, pp. 46–57. IEEE Computer Society, Los Alamitos (1977)
Yoneda, T., Kitai, T., Myers, C.J.: Automatic derivation of timing constraints by failure analysis. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 195–208. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
André, É., Soulat, R. (2011). Synthesis of Timing Parameters Satisfying Safety Properties. In: Delzanno, G., Potapov, I. (eds) Reachability Problems. RP 2011. Lecture Notes in Computer Science, vol 6945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24288-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-24288-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24287-8
Online ISBN: 978-3-642-24288-5
eBook Packages: Computer ScienceComputer Science (R0)