Sciweavers

1895 search results - page 34 / 379
» Using ATL for Checking Models
Sort
View
154
Voted
ATAL
2004
Springer
15 years 6 months ago
Verification of Multiagent Systems via Unbounded Model Checking
We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend ...
Magdalena Kacprzak, Alessio Lomuscio, Wojciech Pen...
FOSSACS
2001
Springer
15 years 6 months ago
Model Checking CTL+ and FCTL is Hard
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
François Laroussinie, Nicolas Markey, Ph. S...
STTT
2010
116views more  STTT 2010»
14 years 9 months ago
LTL satisfiability checking
Abstract. We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-...
Kristin Y. Rozier, Moshe Y. Vardi
128
Voted
DLOG
2006
15 years 3 months ago
Model checking the basic modalities of CTL with Description Logic
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...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
129
Voted
ENTCS
2007
119views more  ENTCS 2007»
15 years 2 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva