380 search results - page 21 / 76 » Model Checking Temporal Logics of Knowledge in Distributed S... |
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
ECBS
2006
IEEE
15 years 3 months ago
2006
IEEE
The paper depicts experiments and results with preditraction based verification applied to infinite state Predicate abstraction is a method for automatic tion of abstract state sp...
FIW
2007
15 years 1 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 ...
116
click to vote
OPODIS
2003
15 years 1 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
113
click to vote
TABLEAUX
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...