Re-verification of a Lip Synchronization Algorithm using robust reachability

Share/Save/Bookmark

Kordy, Piotr and Langerak, Rom and Polderman, Jan Willem (2009) Re-verification of a Lip Synchronization Algorithm using robust reachability. In: Formal Methods for Aerospace, FMA, 03 Nov 2009, Eindhoven, The Netherlands.

[img]
Preview
PDF
232Kb
Abstract: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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/69034
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page