Modelling Systems over General Linear Time

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.

[1]  Thomas A. Henzinger,et al.  Logics and Models of Real Time: A Survey , 1991, REX Workshop.

[2]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[3]  Tim French,et al.  Synthesis for Temporal Logic over the Reals , 2012, Advances in Modal Logic.

[4]  Tim French,et al.  Model Checking General Linear Temporal Logic , 2013, TABLEAUX.

[5]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[6]  Tim French,et al.  Verifying Temporal Properties in Real Models , 2013, LPAR.

[7]  Tim French,et al.  Indiscrete Models: Model Building and Model Checking over Linear Time , 2013, ICLA.

[8]  Tim French,et al.  Complexity of Model Checking over General Linear Time , 2013, 2013 20th International Symposium on Temporal Representation and Reasoning.

[9]  John P. Burgess,et al.  The decision problem for linear temporal logic , 1985, Notre Dame J. Formal Log..

[10]  Tim French,et al.  Synthesis for continuous time , 2015, Theor. Comput. Sci..

[11]  Mark Reynolds.  The complexity of temporal logic over the reals , 2010, Ann. Pure Appl. Log..

[12]  Ji Bian.  An efficient tableau for reasoning over general linear time , 2015 .

[13]  H. Läuchli,et al.  On the elementary theory of linear order , 1966 .

[14]  Alexander Moshe Rabinovich.  Temporal logics over linear time domains are in PSPACE , 2012, Inf. Comput..

[15]  Countably Complementable,et al.  LINEAR ORDERINGS , 2006 .

[16]  Mark Reynolds,et al.  A Tableau for Temporal Logic over the Reals , 2014, Advances in Modal Logic.

[17]  John P. Burgess,et al.  Axioms for tense logic. I. "Since" and "until" , 1982, Notre Dame J. Formal Log..