Sciweavers

5216 search results - page 32 / 1044
» Planning as Model Checking
Sort
View
ATAL
2006
Springer
14 years 2 months ago
The complexity of model checking concurrent programs against CTLK specifications
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
Alessio Lomuscio, Franco Raimondi
ICSE
2008
IEEE-ACM
14 years 11 months ago
Global consistency checking of distributed models with TReMer+
We present TReMer+, a tool for consistency checking of distributed models (i.e., models developed by distributed teams). TReMer+ works by first constructing a merged model before ...
Mehrdad Sabetzadeh, Shiva Nejati, Steve M. Easterb...
FOSSACS
2001
Springer
14 years 3 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...
CAV
2006
Springer
110views Hardware» more  CAV 2006»
14 years 2 months ago
Improving Pushdown System Model Checking
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
Akash Lal, Thomas W. Reps
FSTTCS
2000
Springer
14 years 2 months ago
Model Checking CTL Properties of Pushdown Systems
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
Igor Walukiewicz