6608 search results - page 71 / 1322 » On the Completeness of Model Checking |
115
click to vote
CAV
2003
Springer
15 years 6 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
95
Voted
AAAI
2004
15 years 2 months ago
2004
Model checking is a promising approach to automatic verification, which has concentrated on specification expressed in temporal logic. Comparatively little attention has been give...
99
Voted
LMCS
2006
15 years 23 days ago
2006
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
113
click to vote
IPL
2010
14 years 11 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
ICST
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...