Propositional Temporal Interval Logic is PSPACE Complete

We define a notion of πα equivalence of two execution sequences, where π is the set of variables shared between the two sequences and α is a set of variables disjoint from π appearing in only one of them. We call the set of variables α as auxiliary variables. We extend the notion of πα equivalence to formulas in temporal logics, and there by to classes of temporal logics. Under such a notion, we provide sound and complete translation scheme from Propositional Temporal Interval Logic(PTIL) to Linear Time Propositional Temporal Logic (PTL). We do so via the introduction of a chop operator into PTL. The PTIL that we consider is of Swartz, Melliar-Smith variety[13]. The translations that we give are Polynomial in space and time. Together with the results of Sistla and Clarke[14], we conclude that the satisfiability problem for PTIL is PSpace. Known decision procedures for PTIL are exponential in space[9]. The translations provide a means with which synchronization skeletons could be synthesized from specifications given in PTIL. We have constructed a prolog based prototype implementation of the synthesizer.

[1]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[2]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[4]  Fred Krögr Temporal Logic Of Programs , 1987 .

[5]  David A. Plaisted,et al.  A Low Level Language for Obtaining Decision Procedure for Classes of temporal Logics , 1983, Logic of Programs.

[6]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[7]  Amir Pnueli,et al.  A Choppy Logic , 1986, LICS.

[8]  Edmund M. Clarke,et al.  Automatic verification of asynchronous circuits using temporal logic , 1986 .

[9]  P. M. Melliar-Smith,et al.  An interval logic for higher-level temporal reasoning , 1983, PODC '83.

[10]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, TOPL.

[11]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[12]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[13]  Masahiro Fujita,et al.  Specifying Hardware in temporal Logic & Efficient Synthesis of State-Diagrams Using Prolog , 1984, Fifth Generation Computer Systems.