A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In the context of real-time systems, Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent and widely used extensions of Linear Temporal Logic. In this paper, we examine the possibility of using MTL and TPTL to specify properties about classes of non-monotonic data languages over the natural numbers. Words in this class may model the behaviour of, e.g., one-counter machines. We proved, however, that the satisfiability problem for many reasonably expressivedoi:10.1007/978-3-319-04921-2_20 fatcat:krsoynwz4fgchkdrq7rjkqlhfu