257 search results - page 33 / 52 » The Complexity of Model Checking for Propositional Default L... |
ACSD
2008
IEEE
13 years 9 months ago
2008
IEEE
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
FMSD
2006
13 years 7 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
DLT
2009
13 years 5 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...