175 search results - page 19 / 35 » The Complexity of Model Checking Higher-Order Fixpoint Logic |
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
The ability to guarantee that a system will continue to operate correctly under degraded conditions is key to the success of adopting multi-agent systems (MAS) as a paradigm for d...
CONCUR
2007
Springer
15 years 1 months ago
2007
Springer
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...
ACSD
2008
IEEE
14 years 11 months ago
2008
IEEE
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
FMSD
2006
14 years 9 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...