Model-checking timed temporal logics
P Bouyer - Electronic notes in theoretical computer science, 2009 - Elsevier
Model-checking Timed Temporal Logics Page 1 Model-checking Timed Temporal Logics
Patricia Bouyer1,2 LSV, CNRS & ENS Cachan, France Oxford University Computing …
Patricia Bouyer1,2 LSV, CNRS & ENS Cachan, France Oxford University Computing …
On the expressiveness of TPTL and MTL
TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer
a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show that …
a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show that …
On the expressiveness of MTL in the pointwise and continuous semantics
D D'Souza, P Prabhakar - International Journal on Software Tools for …, 2007 - Springer
We show that the pointwise version of the logic MTL is strictly less expressive than the
continuous version, over finite words. The proof is constructive in that we exhibit a timed …
continuous version, over finite words. The proof is constructive in that we exhibit a timed …
On the expressiveness of TPTL and MTL
TPTL and MTL are two classical timed extensions of LTL. In this paper, we prove the 20-year-
old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly …
old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly …
Switching control of dynamical systems from metric temporal logic specifications
J Liu, P Prabhakar - 2014 IEEE International Conference on …, 2014 - ieeexplore.ieee.org
Motivated by designing high-level planners for dynamical systems (such as mobile robots) to
achieve complex tasks, we consider the synthesis of switching controllers of nonlinear …
achieve complex tasks, we consider the synthesis of switching controllers of nonlinear …
Monitoring dense-time, continuous-semantics, metric temporal logic
K Baldor, J Niu - … Verification: Third International Conference, RV 2012 …, 2013 - Springer
The continuous semantics and dense time model most closely model the intuitive meaning
of properties specified in metric temporal logic (mtl). To date, monitoring algorithms for mtl …
of properties specified in metric temporal logic (mtl). To date, monitoring algorithms for mtl …
[HTML][HTML] An SMT-based approach to satisfiability checking of MITL
MM Bersani, M Rossi, P San Pietro - Information and Computation, 2015 - Elsevier
We present a satisfiability-preserving reduction from MITL interpreted over finitely-variable
continuous behaviors to Constraint LTL over clocks, a variant of CLTL that is decidable, and …
continuous behaviors to Constraint LTL over clocks, a variant of CLTL that is decidable, and …
On the expressiveness of MTL variants over dense time
CA Furia, M Rossi - International Conference on Formal Modeling and …, 2007 - Springer
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 not …
variants. In particular it can be strict (when it does not constrain the current instant) or not …
From non-punctuality to non-adjacency: A quest for decidability of timed temporal logics with quantifiers
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent
real-time extensions of Linear Temporal Logic (LTL). In general, the satisfiability checking …
real-time extensions of Linear Temporal Logic (LTL). In general, the satisfiability checking …
Metric temporal logic with counting
Metric Temporal Logic with Counting | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart Book …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart Book …