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.
Lingua originale | Inglese |
---|---|
Pagine | 133-139 |
Numero di pagine | 7 |
DOI | |
Stato di pubblicazione | Pubblicato - 2004 |
Evento | Proceedings - 11th International Symposium on Temporal Representation and Reasoning (TIME 2004) - Tatihou, France Durata: 1 lug 2004 → 3 lug 2004 |
???event.eventtypes.event.conference???
???event.eventtypes.event.conference??? | Proceedings - 11th International Symposium on Temporal Representation and Reasoning (TIME 2004) |
---|---|
Paese/Territorio | France |
Città | Tatihou |
Periodo | 1/07/04 → 3/07/04 |