LTL Goal Specifications Revisited

Authors:
Andreas Bauer;Patrik Haslum
Affiliations:
Australian National University, and NICTA. Email: {andreas.bauer,patrik.haslum}@anu.edu.au;Australian National University, and NICTA. Email: {andreas.bauer,patrik.haslum}@anu.edu.au
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 9
Cited 1

Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
Rewriting-Based Techniques for Runtime Verification

Automated Software Engineering
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners

Artificial Intelligence
Planning with first-order temporally extended goals using heuristic search

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Decision-theoretic planning with non-Markovian rewards

Journal of Artificial Intelligence Research
Complexity results for planning

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
LTL satisfiability checking

Proceedings of the 14th international SPIN conference on Model checking software
Comparing LTL Semantics for Runtime Verification

Journal of Logic and Computation

Computing infinite plans for LTL goals using a classical planner

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three

Quantified Score

Hi-index	0.01

Visualization

Abstract

The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the semantics of LTL is defined wrt. infinite state sequences, while a finite plan generates only a finite trace. This necessitates the use of a finite trace semantics for LTL. A common approach is to evaluate LTL formulae on an infinite extension of the finite trace, obtained by infinitely repeating the last state. We study several aspects of this finite LTL se mantics: we show its satisfiability problem is PSpace-complete (same as normal LTL), show that it complies with all equivalence laws that hold under standard (infinite) LTL semantics, and compare it with other finite trace semantics for LTL proposed in planning and in runtime verification. We also examine different mechanisms for determining whether or not a finite trace satisfies or violates an LTL formula, interpreted using the infinite extension semantics.