138 search results - page 25 / 28 » Linear Encodings of Bounded LTL Model Checking |
QEST
2008
IEEE
14 years 1 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
FM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
-In order to implement a continuous and robust dynamic localization of a mobile robot, the fusion of dead reckoning and absolute sensors is often used. Depending on the objectives ...
SEFM
2009
IEEE
14 years 2 months ago
2009
IEEE
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...