72 search results - page 4 / 15 » On the Parallel Complexity of Model Checking in the Modal Mu... |
STTT
2011
13 years 1 months ago
2011
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). Our improvements target the numerical components of the tradit...
TIME
2003
IEEE
13 years 11 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
KI
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
ISSTA
2006
ACM
14 years 6 days ago
2006
ACM
We present a method to verify the correctness of parallel programs that perform complex numerical computations, including computations involving floating-point arithmetic. The me...