Implementing timed automata specifications: the "sandwich" approach

Abstract : From a highly distributed timed automata specification, the paper analyses an implementation in the form of a looping controller, launching possibly many tasks in each cycle. Qualitative and quantitative constraints are distinguished on the specification to allow such an implementation, and the analysis of the semantic differences between the specification and the implementation leads to define an overapproximating model. The implementation is then "sandwiched" between the original specification and the new model, allowing to check if the important properties of the specification are preserved by the implementation.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00841771
Contributor : Frédéric Davesne <>
Submitted on : Wednesday, July 17, 2013 - 11:20:12 AM
Last modification on : Monday, October 28, 2019 - 11:00:24 AM
Long-term archiving on: Wednesday, April 5, 2017 - 7:43:49 AM

File

sandwich.pdf
Files produced by the author(s)

Identifiers

Citation

Raymond Devillers, Jean-Yves Didier, Hanna Klaudel. Implementing timed automata specifications: the "sandwich" approach. 13th International Conference on Application of Concurrency to System Design (ACSD 2013), Jul 2013, Barcelona, Spain. pp.233--242, ⟨10.1109/ACSD.2013.26⟩. ⟨hal-00841771⟩

Share

Metrics

Record views

360

Files downloads

217