259 search results - page 38 / 52 » Bounded Model Checking for Timed Automata |
118
click to vote
ERSHOV
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
166
click to vote
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
142
click to vote
ICRA
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...
LICS
2007
IEEE
15 years 5 months ago
2007
IEEE
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...
119
click to vote
DDECS
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...