402 search results - page 18 / 81 » Model Checking Quantified Computation Tree Logic |
74
Voted
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
FORMATS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
70
Voted
IJCAI
2007
14 years 11 months ago
2007
In this paper we prove that the well-known correspondence between the forward-backward algorithm for hidden Markov models (HMMs) and belief propagation (BP) applied to HMMs can be...
103
click to vote
AAAI
2006
14 years 11 months ago
2006
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
FIW
2007
14 years 11 months ago
2007
Feature interaction detection methods, whether online or offline, depend on previous knowledge of conflicts between the actions executed by the features. This knowledge is usually ...