296 search results - page 1 / 60 » Solving the ignoring problem for partial order reduction |
STTT
2010
13 years 3 months ago
2010
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
AUSAI
2008
Springer
13 years 11 months ago
2008
Springer
In this paper the notion of a partial-order plan is extended to task-hierarchies. We introduce the concept of a partial-order taskhierarchy that decomposes a problem using multi-ta...
SPIN
2005
Springer
14 years 2 months ago
2005
Springer
We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by...
IJCAI
2003
13 years 10 months ago
2003
This paper discusses the specifics of planning in multiagent environments. It presents the formal framework MAPL (“maple”) for describing multiagent planning domains. MAPL al...
TACAS
2010
Springer
14 years 4 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...