713 search results - page 26 / 143 » Model Checking and Transitive-Closure Logic |
114
click to vote
ERSHOV
2006
Springer
15 years 26 days ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
93
Voted
AIIA
2007
Springer
15 years 5 months ago
2007
Springer
In this work, we present a constrained-based representation for specifying the goals of “course design”, that we call curricula model, and introduce a graphical language, groun...
92
Voted
SIGSOFT
2003
ACM
15 years 4 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
86
Voted
DSN
2004
IEEE
15 years 2 months ago
2004
IEEE
In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action- and state-l...
85
Voted
ATAL
2005
Springer
15 years 4 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...