Sciweavers

18 search results - page 1 / 4
» On the decidability and complexity of Metric Temporal Logic ...
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 4 months ago
On the decidability and complexity of Metric Temporal Logic over finite words
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
Joël Ouaknine, James Worrell
LICS
2005
IEEE
13 years 10 months ago
On the Decidability of Metric Temporal Logic
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
Joël Ouaknine, James Worrell
CSL
2006
Springer
13 years 4 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin
FORMATS
2008
Springer
13 years 5 months ago
MTL with Bounded Variability: Decidability and Complexity
This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the ...
Carlo A. Furia, Matteo Rossi
LPAR
2010
Springer
13 years 2 months ago
On the Satisfiability of Two-Variable Logic over Data Words
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
Claire David, Leonid Libkin, Tony Tan