257 search results - page 22 / 52 » The Complexity of Model Checking for Propositional Default L... |
103
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
FORMATS
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
116
click to vote
LFCS
2007
Springer
15 years 5 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
CSL
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...