The timed automata formalism is an important model for specifying and analysing real-time systems. Robustness is the correctness of the model in the presence of small drifts on clocks or imprecision in testing guards. A symbolic algorithm for the analysis of the robustness of timed automata has been implemented. In this paper we re-analyse an industrial case lip synchronization protocol using the new robust reachability algorithm.This lip synchronization protocol is an interesting case because timing aspect are crucial for the correctness of the protocol. Several versions of the model are considered, with an ideal video stream, with anchored jitter, and with non-anchored jitter.
|Title of host publication||Workshop on Formal Methods for Aerospace (FMA)|
|Place of Publication||Manchester|
|Publisher||Manchester Institute for Mathematical Sciences|
|Number of pages||14|
|Publication status||Published - 3 Nov 2009|
|Event||Workshop on Formal Methods for Aerospace, FMA 2009: A workshop affiliated with Formal Methods Week (FM2009) - Eindhoven, Netherlands|
Duration: 3 Nov 2009 → 3 Nov 2009
|Workshop||Workshop on Formal Methods for Aerospace, FMA 2009|
|Period||3/11/09 → 3/11/09|
- Timed Automata
- Formal Modelling
Kordy, P., Langerak, R., & Polderman, J. W. (2009). Re-verification of a Lip Synchronization Algorithm using robust reachability. In Workshop on Formal Methods for Aerospace (FMA) Manchester: Manchester Institute for Mathematical Sciences.