We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving. As a proof-of-concept of this framework, we describe a new LTL satisfiability algorithm. We implemented the algorithm in a tool, Aalta v2.0, which is built on top of the Minisat SAT solver. We tested the effectiveness of this approach by demons...

In this short note we address the issue of expressing norms (such as obligations and prohibitions) in temporal logic. In particular, we address the argument from [1] that norms cannot be expressed in Linear Time Temporal Logic (LTL). Recently, doubts were raised in [1] regarding suitability of LTL and other temporal logics for expressing ‘real life’ norms. We claim that the argument in [1] does...

Within the timeline-based framework, planning problems are modeled as sets of independent, but interacting, components whose behavior over time is described by a set of temporal constraints. Timeline-based planning is being used successfully in a number of complex tasks, but its theoretical properties are not so well studied. In particular, while it is known that Linear Temporal Logic (LTL) can...

We study a linear temporal logic LTLNT with non-transitive time (with NEXT and UNTIL) and possible interpretations for logical knowledge operations in this approach. We assume time to be non-transitive, linear and discrete, it is a major innovative part of our article. Motivation for our approach that time might be non-transitive and comments on possible interpretations of logical knowledge ope...

The problem caused by feature interactions serve to delay and increase the costs of introducing features to existing networks. We introduce a three stage technique that detects interactions in the TETRA network. Promela is used to model the network and features and its requirements are specified using linear temporal logic. The Xspin toolkit is used to verify and validate the model against its ...

We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL+ Past (which in turn can be more succinct than LTL). We study satisfiability and model checking for NLTL and provide optimal automata-theoretic algorithms for these EXPSPACE-complete problems.

An institution for a simple logic of behaviour is built using a cofibration from a category of transition systems into the envisaged category of signatures. The chosen propositional, linear temporal logic distinguishes between event occurrence and event enabling. The satisfaction condition is proved using a fibered adjunction between transition systems and their computations. The operational se...

We prove weak (finite set of premises) completeness theorem for extended propositional linear time temporal logic with irreflexive version of until-operator. We base it on the proof of completeness for basic propositional linear time temporal logic given in [20] which roughly follows the idea of the Henkin-Hasenjaeger method for classical logic. We show that a temporal model exists for every fo...

TaLiRo (TemporAl LogIc RObustness) is a tool for the computation of the robustness of a propositional temporal logic specification with respect to a discrete time signal. This document provides a brief introduction to Linear and Metric Temporal Logics, describes the usage of the toolbox and concludes with several examples. This guide refers to version v0.1 of TaLiRo.

The speci cation of communication behavior is fundamental in devel oping interoperable transactions In particular the temporal ordering of messages exchanged between di erent communicating agents must be declar atively speci ed and veri ed in order to guarantee consistency of data in the various component systems This paper shows that by expressing communi cation constraints in propositional te...