Abstraction strategies for computing travelling or looping durations in networks of timed automata

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01364726
Contributor : Frédéric Davesne <>
Submitted on : Wednesday, July 18, 2018 - 3:27:29 AM
Last modification on : Monday, October 28, 2019 - 10:50:22 AM
Long-term archiving on: Friday, October 19, 2018 - 4:20:52 PM

File

Devillers-Klaudel2016.pdf
Files produced by the author(s)

Identifiers

Citation

Raymond Devillers, Hanna Klaudel. Abstraction strategies for computing travelling or looping durations in networks of timed automata. 14th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2016), Aug 2016, Quebec, Canada. pp.140--156, ⟨10.1007/978-3-319-44878-7_9⟩. ⟨hal-01364726⟩

Share

Metrics

Record views

183

Files downloads

76