Paper Info
Title
Re-Verification Of A Lip Synchronization Protocol Using Robust Reachability
Abstract
The timed automata formalism is an importantmodel 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.
Year
DOI
Venue
2009
10.4204/EPTCS.20.5
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE
Keywords
Field
DocType
real time systems
Synchronization,Computer science,Automaton,Correctness,Reachability,Robustness (computer science),Real-time computing,Theoretical computer science,Timed automaton,Jitter,Formalism (philosophy)
Journal
Volume
Issue
ISSN
abs/1003.0
20
2075-2180
Citations 
PageRank 
References 
2
0.37
17
Authors
3
Name
Order
Citations
PageRank
Piotr Kordy1423.65
Rom Langerak230839.16
Jan Willem Polderman3245.26