212 search results - page 12 / 43 » Completeness and Complexity of Bounded Model Checking |
TIME
2009
IEEE
14 years 2 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
EPEW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Recently, there is an explosive development of fluid approaches to computer and distributed systems. These approaches are inherently stochastic and generate continuous st...
CSL
2009
Springer
14 years 2 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...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
BMCBI
2007
13 years 7 months ago
2007
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...