Re-verification of a Lip Synchronization Protocol using Robust Reachability

P.T. Kordy, L.M. Bujorianu (Editor), Romanus Langerak, Michael Fischer (Editor), Jan W. Polderman

    Research output: Contribution to journalArticleAcademicpeer-review

    5 Citations (Scopus)
    117 Downloads (Pure)


    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.
    Original languageUndefined
    Pages (from-to)49-62
    Number of pages14
    JournalElectronic proceedings in theoretical computer science
    Publication statusPublished - 2010
    EventWorkshop on Formal Methods for Aerospace, FMA 2009: A workshop affiliated with Formal Methods Week (FM2009) - Eindhoven, Netherlands
    Duration: 3 Nov 20093 Nov 2009


    • IR-75784
    • EWI-19407
    • METIS-277505

    Cite this