445 search results - page 64 / 89 » Model Checking Quantitative Linear Time Logic |
CADE
2006
Springer
16 years 6 hour ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
103
click to vote
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
Abstract-- We present a computational framework for automatic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Te...
130
click to vote
PODS
1994
ACM
15 years 3 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
QEST
2008
IEEE
15 years 6 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
ECSQARU
2007
Springer
15 years 5 months ago
2007
Springer
This paper presents a new approach to inference in Bayesian networks. The principal idea is to encode the network by logical sentences and to compile the resulting encoding into an...