Abstract
Parametric timed automata (PTA) allow the specification and verification of timed systems incompletely specified, or subject to future changes. The behavioral cartography splits the parameter space of PTA in tiles in which the discrete behavior is uniform. Applications include the optimization of timing constants, and the measure of the system robustness w.r.t. the untimed language. Here, we present enhanced distributed algorithms to compute the cartography efficiently. Experimental results show that our new algorithms significantly outperform previous distribution techniques.
This work was partially supported by the ANR national research program “PACS” (ANR-2014), and the INS2I PEPS JCJC 2015 “PSyCoS” project.
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
Notes
- 1.
[2] was published in a distributed computing community and focused on the parallelization technique used for this particular application, and the paper did not go into formal details. This is not an actual contribution of the current paper, but makes it standalone.
- 2.
Alternatively, a single node could perform the split and then send to each other node its own subdomain (at the cost of additional communications).
- 3.
For efficiency purpose, in our implementation, the master only sends the new tiles since n’s latest request (which is ensured using additional queue data structures).
- 4.
The local list is necessary to detect whether a point in the worker’s subdomain is covered by a tile computed by another worker.
- 5.
Additionally, the worker checks whether the master has split its subdomain, because some other worker completed its own subdomain. In our implementation, this requires on the worker’s side frequent (but inexpensive) checks whether the master has split the worker’s current subdomain and, if so, a simple update of the subdomain.
- 6.
Source models and results are available at www.imitator.fr/static/ICFEM15/.
References
Alur, R., Henzinger, T. A., Vardi, M.Y.: Parametric real-time reasoning. In: STOC, pp. 592–601. ACM (1993)
André, É., Coti, C., Evangelista, S.: Distributed behavioral cartography of timed automata. In: EuroMPI/ASIA, pp. 109–114. ACM (2014)
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., Kühne, U., Soulat, R.: IMITATOR 2.5: a tool for analyzing robustness in scheduling problems. In: Giannakopoulou, D., Méry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 33–36. Springer, Heidelberg (2012)
André, É., Lipari, G., Nguyen, H.G., Sun, Y.: Reachability preservation based parameter synthesis for timed automata. In: Havelund, K., Holzmann, G., Joshi, R. (eds.) NFM 2015. LNCS, vol. 9058, pp. 50–65. Springer, Heidelberg (2015)
André, É., Markey, N.: Language preservation problems in parametric timed automata. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 27–43. Springer, Heidelberg (2015)
André, É., Soulat, R.: The Inverse Method. ISTE Ltd and Wiley & Sons, London, UK (2013)
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)
Cimatti, A., Griggio, A., Mover, S., Tonetta, S.: Parameter synthesis with IC3. In: FMCAD, pp. 165–168. IEEE (2013)
De Wulf, M., Doyen, L., Raskin, J.: Almost ASAP semantics: from timed models to timed implementations. Formal Aspects Comput. 17(3), 319–341 (2005)
Evangelista, S., Laarman, A., Petrucci, L., van de Pol, J.: Improved multi-core nested depth-first search. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 269–283. Springer, Heidelberg (2012)
Hamidouche, K., Borghi, A., Esterie, P., Falcou, J., Peyronnet, S.: Three high performance architectures in the parallel APMC boat. In: PMDC. IEEE (2010)
Jovanović, A., Lime, D., Roux, O.H.: Integer parameter synthesis for timed automata. IEEE Trans. Softw.Eng. 41(5), 445–461 (2015)
Kahsai, T., Tinelli, C.: PKind: a parallel \(k\)-induction based model checker. In: PDMC, vol. 72, pp. 55–62 (2011)
Laarman, A., Olesen, M.C., Dalsgaard, A.E., Larsen, K.G., van de Pol, J.: Multi-core emptiness checking of timed Büchi automata using inclusion abstraction. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 968–983. Springer, Heidelberg (2013)
Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Int. J. Softw. Tools Technol. Transf. 1(1–2), 134–152 (1997)
Markey, N.: Robustness in real-time systems. In: SIES, pp. 28–34. IEEE Computer Society Press (2011)
Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: towards flexible verification under fairness. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 709–714. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
André, É., Coti, C., Nguyen, H.G. (2015). Enhanced Distributed Behavioral Cartography of Parametric Timed Automata. In: Butler, M., Conchon, S., Zaïdi, F. (eds) Formal Methods and Software Engineering. ICFEM 2015. Lecture Notes in Computer Science(), vol 9407. Springer, Cham. https://doi.org/10.1007/978-3-319-25423-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-25423-4_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25422-7
Online ISBN: 978-3-319-25423-4
eBook Packages: Computer ScienceComputer Science (R0)