Re-verification of a Lip Synchronization Protocol using Robust Reachability

Piotr Kordy
(University of Twente, NL)
Rom Langerak
(University of Twente, NL)
Jan Willem Polderman
(University of Twente, NL)

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 aspects 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.

In Manuela Bujorianu and Michael Fisher: Proceedings FM-09 Workshop on Formal Methods for Aerospace (FMA 2009), Eindhoven, The Netherlands, 3rd November 2009, Electronic Proceedings in Theoretical Computer Science 20, pp. 49–62.
Published: 28th March 2010.

ArXived at: bibtex PDF

Comments and questions to:
For website issues: