Re-verification of a Lip Synchronization Protocol using Robust Reachability

Share/Save/Bookmark

Kordy, Piotr and Langerak, Rom and Polderman, Jan Willem (2010) Re-verification of a Lip Synchronization Protocol using Robust Reachability. In: Proceedings FM-09 Workshop on Formal Methods for Aerospace. Electronic Proceedings in Theoretical Computer Science, 20 . EPTCS, pp. 49-62.

open access
[img]
Preview
PDF
222kB
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 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.
Item Type:Book Section
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/75784
Official URL:http://dx.doi.org/10.4204/EPTCS.20.5
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page