This paper challenges the prevailing pessimism about the scale-up ability of partial order planners (POP) by presenting several novel heuristic control techniques that make the PO planners competitive with the state of the art plan synthesis algorithms. Our critical insight is that the techniques responsible for the efficiency of the currently successful planners–viz., distance based heuristics...

Reasoning about plans and actions is fundamental to intelligent control of real-world systems such as AUVs. These plans can come from a library of existing plans or from creating a new plan if no appropriate plan exists for the situation. The Orca project [Turner, 1994] is an ongoing effort to create an intelligent system for mission-level control of autonomous underwater vehicles. Orca’s prima...

We develop a partial order reduction method for labeled transition systems over metric spaces. We introduce the notion of ε-independent actions such that executing these actions in any order results in states that are close to each other. Then we define ε-equivalent action sequences that swap ε-independent action pairs. We present an algorithm to over-approximate the reach set of executions tha...

Streszczenie Problem eksplozji stann ow mo_ ze zosta c ograniczony poprzez u_ zycie redukcji cz , e sciowo-porz , adkowych. Metody te polegaj , a na budowaniu tylko frag-mentu pee lnej przestrzeni stann ow programu, ktt ory jest wystarczaj , acy do wery-kacji formuu l logik temporalnych LTL ?X lub CTL ?X (tzn. LTL lub CTL* bez operatora nast , epnego kroku). Jest to zagwarantowane poprzez za-ch...

This work presents a new formal model for specification and synthesis of microcontrol circuits. The model, called Conditional Partial Order Graph, captures concurrency and choice in a system’s behaviour in a compact and efficient way. It is especially beneficial for a class of systems which have many behavioural scenarios defined on the same set of primitive events or actions, e.g. CPU microcon...

To date, many different formalisms exist for describing and analyzing the behavior of concurrent systems. Petri nets and process algebras are two well-known classes of such formalisms. Petri-net theory is well suited for reasoning about concurrent systems in a partial-order framework; it handles causal relationships between actions of concurrent systems in an explicit way. Process algebras, on ...

We present a symbolic dynamic partial order reduction (POR) method for model checking concurrent software. We introduce the notion of guarded independent transitions, i.e., transitions that can be considered as independent in certain (but not necessarily all) execution paths. These can be exploited by using a new peephole reduction method. A symbolic formulation of the proposed peephole reducti...

Partial Order Reduction (POR) techniques improve the basic model checking algorithm by reducing the numbers of states and transitions explored in verifying a property of the model. In the “ample set” POR framework for the verification of an LTL−X formula φ, one associates to each state s a subset Ts of the set of all transitions enabled at s. The approach requires that whenever Ts is a proper s...

This paper shows the use of partial-order assertions and lattice domains for logic programming. We illustrate the paradigm using a variety of examples, ranging from program analysis to deductive databases. These applications are characterized by a need to solve circular constraints and perform aggregate operations. We show in this paper that deening functions with subset assertions and, more ge...