Sciweavers

289 search results - page 37 / 58
» Regular Linear Temporal Logic
Sort
View
RTSS
1997
IEEE
15 years 3 months ago
On-the-fly symbolic model checking for real-time systems
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
Ahmed Bouajjani, Stavros Tripakis, Sergio Yovine
ASE
2010
129views more  ASE 2010»
14 years 11 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
HAPTICS
2009
IEEE
15 years 6 months ago
Effects of haptic device attributes on vibration detection thresholds
Human vibrotactile detection experiments were used to compare temporal sinusoids displayed on three commercial haptic devices to a high-fidelity linear voice-coil actuator. The t...
Curt Salisbury, R. Brent Gillespie, Hong Z. Tan, F...
CADE
2002
Springer
16 years 11 hour ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
TOCL
2011
87views more  TOCL 2011»
14 years 6 months ago
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
Michael Bauland, Martin Mundhenk, Thomas Schneider...