In this paper we present a folding algorithm to construct a process model from a specification given by a set of scenarios. Each scenario is formalized as a partially ordered set of activities of the process. As a process model we consider Event-driven Process Chains which are well established in the domain of business process modeling. Assuming that a specification describes valid behavior of ...

A partiallyordered multiset or pomset is a generalizationof a string in which the total order has been relaxed to a partial order. Strings are often used as a model for sequential computation; pomsets are a natural model for parallel and distributed computation. By viewing pomsets as a generalization of strings, the question is raised whether concepts from language theory can be generalized to ...

This paper deals with the revision of partially ordered beliefs. It proposes a semantic representation of epistemic states by partial preorders on interpretations and a syntactic representation by partially ordered belief bases. Two revision operations, the revision stemming from the history of observations and the possibilistic revision, defined when the epistemic state is represented by a tot...

Over the years increasing sophisticated planning algorithms have been developed. These have made for more efficient planners. However, current state of the art planners still suffer from severe complexity problems, problems that can surface even in domains in which good plans are easy to generate, like the blocks world. Planners generally employ search to find plans, and planning research has i...

The elements of a finite nonempty partially ordered set are exposed at independent uniform times in [0,1] to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector’s task is to choose online a maximal element. This generalizes the classical linear order secretary problem, for which it is known that the selector can succeed wit...