A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Regular Linear-Time Temporal Logic
2010
2010 17th International Symposium on Temporal Representation and Reasoning
This extended abstract presents the gist of regular linear-time temporal logic (RLTL), a logic that generalizes linear-time temporal logic (LTL) with the ability to use regular expressions arbitrarily as sub-expressions. Unlike LTL, RLTL can define all ω-regular languages and unlike previous approaches, RLTL is defined with an algebraic signature, does not depend on fix-points in its syntax, and provides past operators via a single previous-step operator for basic state formulas. The
doi:10.1109/time.2010.29
dblp:conf/time/LeuckerS10
fatcat:qmbnjwevg5gglpbctmoid6ztje