259 search results - page 22 / 52 » Bounded Model Checking for Timed Automata |
88
Voted
ROBOCUP
2007
Springer
15 years 3 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...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
ENTCS
2007
14 years 9 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
103
click to vote
ENTCS
2006
14 years 9 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
CAV
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...