Predictability of event occurrences in timed systems

Franck Cassez, Alban Grastien

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

    25 Citations (Scopus)

    Abstract

    We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete.

    Original languageEnglish
    Title of host publicationFormal Modeling and Analysis of Timed Systems - 11th International Conference, FORMATS 2013, Proceedings
    Pages62-76
    Number of pages15
    DOIs
    Publication statusPublished - 2013
    Event11th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2013 - Buenos Aires, Argentina
    Duration: 29 Aug 201331 Aug 2013

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume8053 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference11th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2013
    Country/TerritoryArgentina
    CityBuenos Aires
    Period29/08/1331/08/13

    Fingerprint

    Dive into the research topics of 'Predictability of event occurrences in timed systems'. Together they form a unique fingerprint.

    Cite this