A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Stutter-Invariant Languages, ω-Automata, and Temporal Logic
[chapter]
1999
Lecture Notes in Computer Science
Temporal logic and ω-automata are two of the common frameworks for specifying properties of reactive systems in modern verification tools. In this paper we unify these two frameworks in the linear time setting for the specification of stutter-invariant properties, which are used in the context of partial-order verification. We will observe a simple variant of linear time propositional temporal logic (LTL) for expressing exactly the stutter-invariant ω-regular languages. The complexity of, and
doi:10.1007/3-540-48683-6_22
fatcat:erymptso6zfcvbkip5blmzszly