Abs t rac t . Previous works on assumption/guarantee specifications typically reason about relevant properties at the semantic level or define a special-purpose logic. We feel it is beneficial to formulate such specifications in a more widely used formalism. Specifically, we adopt the lineartime temporal logic (LTL) of Manna and Pnueli. We find that, with past temporal operators, LTL admits a s...

TLA (the Temporal Logic of Actions) is a linear temporal logic for specifying and reasoning about reactive systems. We define a subset of TLA whose formulas are amenable to validation by animation, with the intent to facilitate the communication between domain and solution experts in the design of reactive systems.

This paper deals with assurance of logical agent systems via runtime self-monitoring and checking. We adopt temporal-logic-based special constraints to be dynamically checked at a certain (customizable) frequency. These constraints are based upon a simple interval temporal logic particularly tailored to the agent realm, A-ILTL (‘Agent-Oriented Interval LTL’, LTL standing as customary for ‘Linea...

We introduce bisimulations for the logic ITL with ◯ (‘next’), U (‘until’) and R (‘release’), an intuitionistic temporal logic based on structures (W,≼, S), where ≼ is used to interpret intuitionistic implication and S is a ≼-monotone function used to interpret the temporal modalities. Our main results are that ◇ (‘eventually’), which is definable in terms of U , cannot be defined in terms of ◯ ...

We present a new proof of the fact that every formula in linear temporal logic with past is equivalent to a formula of the form ∧