Asymptotic behaviour in temporal logic

E Asarin, M Bockelet, A Degorre, C Dima, Chunyan Mu

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    127 Downloads (Pure)

    Abstract

    We study the “approximability” of unbounded temporal operators with time-bounded operators, as soon as some time bounds tend to∞. More specifically, for formulas in the fragments PLTL♦ and PLTL of the Parametric Linear Temporal Logic of Alur et al., we provide algorithms for computing the limit entropy as all parameters tend to∞. As a consequence, we can decide the problem whether the limit entropy of a formula in one of the two fragments coincides with that of its time-unbounded transformation, obtained by replacing each occurrence of a time-bounded operator into its time-unbounded version. The algorithms proceed by translation of the two fragments of PLTL into two classes of discrete-time timed automata and analysis of their strongly-connected components.
    Original languageEnglish
    Title of host publicationProceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
    PublisherACM
    ISBN (Electronic)978-1-4503-2886-9
    DOIs
    Publication statusPublished - 2014
    EventJoint meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - Vienna, Austria
    Duration: 14 Jul 201418 Jul 2014

    Conference

    ConferenceJoint meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
    CountryAustria
    CityVienna
    Period14/07/1418/07/14

    Fingerprint Dive into the research topics of 'Asymptotic behaviour in temporal logic'. Together they form a unique fingerprint.

  • Profiles

    Cite this

    Asarin, E., Bockelet, M., Degorre, A., Dima, C., & Mu, C. (2014). Asymptotic behaviour in temporal logic. In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) ACM. https://doi.org/10.1145/2603088.2603158