12981 search results - page 36 / 2597 » Model Checking and Abstraction |
98
Voted
FSTTCS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All th...
84
Voted
CORR
2006
Springer
15 years 19 days ago
2006
Springer
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
90
Voted
TACAS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B¨uchi automaton for the negation of the formula ...
104
Voted
TPHOL
1999
IEEE
15 years 4 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
111
Voted
ROBOCUP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper shows how multiagent systems can be modeled by a combination of UML statecharts and hybrid automata. This allows formal system cation on different levels of ab...