29 search results - page 1 / 6 » Model checking the basic modalities of CTL with Description ... |
DLOG
2006
13 years 6 months ago
2006
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
TIME
2009
IEEE
13 years 11 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
ATAL
2005
Springer
13 years 10 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...
ICFEM
2009
Springer
13 years 2 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
ENTCS
2010
13 years 1 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...