Linear Temporal Logic and Buchi Automata
Yih-Kuen Tsay
Abstract
Yih-Kuen Tsay
Abstract
We have seen how automata, in particular Buchi automata, may be used to describe the behaviors of a concurrent system. Buchi automata “localize” temporal dependency between occurrences of events (represented by propositions) to relations between states and tend to be of lower level. We will study an alternative formalism, namely linear temporal logic. Temporal logic formulae describe temporal dependency without explicit references to time points and are in general more abstract.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We have seen how automata, in particular Buchi automata, may be used to describe the behaviors of a concurrent system. Buchi automata “localize” temporal dependency between occurrences of events (represented by propositions) to relations between states and tend to be of lower level. We will study an alternative formalism, namely linear temporal logic. Temporal logic formulae describe temporal dependency without explicit references to time points and are in general more abstract.
Key concepts: Linear temporal logic, Temporal logic, Büchi automaton, Interval temporal logic, Automaton, Formalism (music), Computation tree logic, Temporal logic of actions