A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On-the-fly automata construction for dynamic linear time temporal logic
2004
Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004.
Preserved Fulltext
We present a tableau-based algorithm for obtaining a Büchi automaton from a formula in Dynamic Linear Time Temporal Logic (DLT L), 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 LT L, 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
doi:10.1109/time.2004.1314430
dblp:conf/time/GiordanoM04
fatcat:qdgpfanmcbetzp24qr54ppw2di