Sciweavers

29 search results - page 1 / 6
» On the Expressiveness of MTL Variants over Dense Time
Sort
View
FORMATS
2007
Springer
13 years 11 months ago
On the Expressiveness of MTL Variants over Dense Time
The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several variants. In particular it can be strict (when it does not constrain the current instant) or...
Carlo A. Furia, Matteo Rossi
FORMATS
2008
Springer
13 years 6 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
CONCUR
2009
Springer
13 years 8 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
LICS
2007
IEEE
13 years 11 months ago
The Cost of Punctuality
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
SFM
2004
Springer
120views Formal Methods» more  SFM 2004»
13 years 10 months ago
Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing)
We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other va...
Jos C. M. Baeten, Michel A. Reniers