loading...
On-the-Fly Automata Construction for Dynamic Linear Time Temporal Logic
Tatihou, Normandie, France July 01-July 03
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2004.131443011th International Symposium on Tempo ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Laura Giordano, Università del Piemonte Orientale
Alberto Martelli, Università di Torino
We present a tableau-based algorithm for obtaining a B?uchi 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?uchi automaton rather than a generalized one. The construction can be done on-the-fly, while checking for the emptiness of the automaton.
Citation:
Laura Giordano, Alberto Martelli, "On-the-Fly Automata Construction for Dynamic Linear Time Temporal Logic," time, pp.133-139, 11th International Symposium on Temporal Representation and Reasoning (TIME'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.