Checking liveness properties with partial-order reductions requires a cycle proviso to ensure that an action cannot be postponed forever. The proviso forces each cycle to contain at least one fully expanded state. We present new heuristics to select which state to expand, hoping to reduce the size of the resulting graph. The choice of the state to expand is done when encountering a “dangerous e...

In this paper, we show that despite the great success of some planning approaches, partial-order planning is still an efficient and valid approach for tackling planning problems. The goal of this paper is to show that the effort needed by of a partial-order planner (POP) to solve a problem can be dramatically reduced. By properly exploiting the problem knowledge, it is possible to obtain an app...

The speed with which intelligent systems can react to an action depends on how soon it can be recognized. The ability to recognize ongoing actions is critical in many applications, for example, spotting criminal activity. It is challenging, since decisions have to be made based on partial videos of temporally incomplete action executions. In this paper, we propose a novel discriminative multi-s...

We propose a partial order reduction for model checking security protocols for the secrecy property. Based on this reduction we develop an automatic tool that can check security protocols for secrecy, given a finite execution scenario. We compare this tool to several other tools.

A monadic formula (Y ) is a selector for a formula '(Y ) in a structure M if there exists a unique subset P of M which satis es and this P also satis es '. We show that for every ordinal ! there are formulas having no selector in the structure ( ;<). For !1, we decide which formulas have a selector in ( ;<), and construct selectors for them. We deduce the impossibility of a full generalization ...

Nowadays planning systems are usually based on partially order sets of actions as these sets specify necessary ordering constraints but do not commit otherwise. While computing these sets one usually maintains lists of links in order to detect potential threats. As shown in this paper these maintenance operations are unneccessary if the preconditions as well as eeects of actions are modelled as...