Re-verification of a Lip Synchronization Algorithm using robust reachability

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    19 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 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.
    Original languageEnglish
    Title of host publicationWorkshop on Formal Methods for Aerospace (FMA)
    Place of PublicationManchester
    PublisherManchester Institute for Mathematical Sciences
    Number of pages14
    Publication statusPublished - 3 Nov 2009
    EventWorkshop on Formal Methods for Aerospace, FMA 2009: A workshop affiliated with Formal Methods Week (FM2009) - Eindhoven, Netherlands
    Duration: 3 Nov 20093 Nov 2009


    WorkshopWorkshop on Formal Methods for Aerospace, FMA 2009
    Abbreviated titleFMA


    • METIS-264169
    • IR-69034
    • Timed Automata
    • EWI-16555
    • Formal Modelling
    • CR-F.4.3
    • Verification


    Dive into the research topics of 'Re-verification of a Lip Synchronization Algorithm using robust reachability'. Together they form a unique fingerprint.

    Cite this