63 search results - page 2 / 13 » On the complexity of practical ATL model checking |
FMSD
2006
13 years 5 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
BIBE
2006
IEEE
13 years 11 months ago
2006
IEEE
Bioinformatics data is growing at a phenomenal rate. Besides the exponential growth of individual databases, the number of data depositories is increasing too. Because of the comp...
CLIMA
2008
13 years 6 months ago
2008
Abstract. I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different...
SIGSOFT
2010
ACM
13 years 20 hour ago
2010
ACM
Specification and verification of real-time systems are important research topics which have practical implications. In this work, we present a self-contained toolkit to analyze r...
FMICS
2010
Springer
13 years 5 months ago
2010
Springer
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior mode...