Modelling Systems over General Linear Time

John McCabe-Dansted, Mark Reynolds, Tim French

    Research output: Chapter in Book/Conference paperConference paperpeer-review

    Abstract

    It has been shown that every temporal logic formula satisfiable over general linear time has a model than can be expressed as a finite Model Expression (ME). The reals are a subclass of general linear time, so similar techniques can be used for the reals. Although MEs are expressive enough for this task, they represent only a single class of elementary equivalent models. In the case where time is represented by integers, regular expressions are equivalent to automata. An ME is more similar to a single run of an automaton than the automaton itself. In linear time it is often useful to model a system as an automaton (or regular expression) rather than a single run of the automaton. In this paper we extend MEs with the operators from Regular Expressions to produce Regular Model Expressions (RegMEs). It is known that model checking temporal logic formulas over MEs is PSPACE-complete. We show that model checking temporal logic formulas over RegMEs is also PSPACE-complete.

    Original languageEnglish
    Title of host publicationProceedings - 23rd International Symposium on Temporal Representation and Reasoning
    EditorsC Dyreson, M.R Hansen, L Hunsberger
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Pages130-139
    Number of pages10
    Volume2016-December
    ISBN (Electronic)9781509038251
    DOIs
    Publication statusPublished - 5 Dec 2016
    Event23rd International Symposium on Temporal Representation and Reasoning, TIME 2016 - Kongens Lyngby, Denmark
    Duration: 17 Oct 201619 Oct 2016

    Conference

    Conference23rd International Symposium on Temporal Representation and Reasoning, TIME 2016
    Country/TerritoryDenmark
    CityKongens Lyngby
    Period17/10/1619/10/16

    Fingerprint

    Dive into the research topics of 'Modelling Systems over General Linear Time'. Together they form a unique fingerprint.

    Cite this