Abstract
This paper shows how to abstract networks of timed automata in order to accelerate the analysis of quantitative properties such as path or cycle duration, that would otherwise suffer from the state space explosion. Two approaches are introduced, a single step strategy and an iterative one, where a part of the network of timed automata is merged and abstracted. As a consequence, the state space is reduced and model-checking is simplified. These approaches are illustrated on a case study, where the comparison is done by calculating the cycle time of one automaton in the network, both on the real network and on the two abstracted ones, showing that the method reduces significantly the runtime, or simply renders feasible the analysis of the system.
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.
i.e., a situation where infinitely many moves may/must occur in a finite/zero delay.
References
Alur, R., Dill, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126(2), 183–235 (1994)
Arcile, J., Didier, J., Klaudel, H., Devillers, R., Rataj, A.: Indefinite waitings in MIRELA systems. ESSS 2015, pp. 5–18 (2015). http://dx.doi.org/10.4204/EPTCS.184.1
Carnevali, L., Pinzuti, A., Vicario, E.: Compositional verification for hierarchical scheduling of real-time systems. IEEE Trans. Softw. Eng. 39(5), 638–657 (2013)
Devillers, R., Didier, J.-Y., Klaudel, H.: Specifications, Implementing Timed Automata: The “Sandwich” Approach. ACSD 2013, pp. 226–235. IEEE (2013)
Devillers, R., Didier, J.-Y., Klaudel, H., Arcile, J.: Deadlock and temporal properties analysis in mixed reality applications. ISSRE 2014. IEEE, pp. 55–65 (2014)
Finkbeiner, B., Peter, H.-J., Schewe, S.: Synthesising certificates in networks of timed automata. IET Softw. 4(3), 222–235 (2010)
Hendriks, M., Verhoef, M.: Timed automata based analysis of embedded system architectures. In: Workshop on Parallel and Distributed Real-Time Systems (2006)
Hendriks, M., Larsen, K.: Exact acceleration of real-time model checking. Electr. Notes Theor. Comput. Sci. 65(6), 120–139 (2002)
Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Int. J. Softw. Tools Technol. Transf. 1(1–2), 134–152 (1997)
Möller, M.O.: Parking can get you there faster- model augmentation to speed up real-time model-checking. Electr. Notes Theor. Comput. Sci. 65(6), 202–217 (2002)
Perathoner, S., et al.: Influence of different abstractions on the performance analysis of distributed hard real-time systems. Design Autom. Emb. Sys. 13(1–2), 27–49 (2009)
UPPAAL. http://www.uppaal.org/
Acknowledgements
We are grateful to Jean-Yves Didier, Mathieu Moine and Johan Arcile for their ideas in the early stage of this work. We would like also to thank the anonymous referees for their careful reading and inspiring suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Devillers, R., Klaudel, H. (2016). Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata. In: Fränzle, M., Markey, N. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2016. Lecture Notes in Computer Science(), vol 9884. Springer, Cham. https://doi.org/10.1007/978-3-319-44878-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-44878-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44877-0
Online ISBN: 978-3-319-44878-7
eBook Packages: Computer ScienceComputer Science (R0)