Tableau-based automata construction for dynamic linear time temporal logic*

Authors:
Laura Giordano;Alberto Martelli
Affiliations:
Dipartimento di Informatica, Università del Piemonte Orientale, Alessandria, Italy;Dipartimento di Informatica, Università di Torino, Torino, Italy
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2006

Citing 16
Cited 3

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
Reasoning about infinite computations

Information and Computation
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking multi-agent systems with MABLE

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Constructing automata from temporal logic formulas: a tutorial

Lectures on formal methods and performance analysis
Planning for temporally extended goals

Annals of Mathematics and Artificial Intelligence
Agent Communication Languages: Rethinking the Principles

Computer
Simple on-the-fly automatic verification of linear temporal logic

Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
A Product Version of Dynamic Linear Time Temporal Logic

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications

COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Efficient Büchi Automata from LTL Formulae

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Planning as Model Checking

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Verifying epistemic properties of multi-agent systems via bounded model checking

Fundamenta Informaticae - Concurrency specification and programming
Planning as model checking for extended goals in non-deterministic domains

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Verifying Agent Conformance with Protocols Specified in a Temporal Action Logic

AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
Verifying Agents' Conformance with Multiparty Protocols

Computational Logic in Multi-Agent Systems
Reasoning about web services in a temporal action logic

Reasoning, Action and Interaction in AI Theories and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a tableau-based algorithm for obtaining a Büchi automaton from a formula in Dynamic Linear Time Temporal Logic (DLTL), a logic which extends LTL by indexing the until operator with regular programs. The construction of the states of the automaton is similar to the standard construction for LTL, but a different technique must be used to verify the fulfillment of until formulas. The resulting automaton is a Büchi automaton rather than a generalized one. The construction can be done on-the-fly, while checking for the emptiness of the automaton. We also extend the construction to the Product Version of DLTL.