We present a comprehensive study of the use of value precedence constraints to break value symmetry. We first give a simple encoding of value precedence into ternary constraints that is both efficient and effective at breaking symmetry. We then extend value precedence to deal with a number of generalizations like wreath value and partial interchangeability. We also show that value precedence is...

Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As consequence, some generalizations of have been proposed, in general expressed terms $k$ graphs, by splitting the special way. recent example such an approach, classes $k$-thin introduced generalizing respectively. The complexity recognition each these still open, even fixed $k \geq 2$...

Function design of embedded real-time system introduced the problem of real-time task scheduling with precedence constraint which needs that scheduling sequence produced by algorithm satisfying not only real-time constraint of every task, but also precedence constraint among tasks. Based on parallel topological sort, this paper presents a new on-line scheduling algorithm OSA-RPC which can set p...

This paper presents a distributed algorithm for the partial precedence constrained scheduling problem. In the classical precedence constrained scheduling problem all the dependent tasks must be scheduled before the task itself can be scheduled. The partial precedence constrained scheduling problem is a generalized version of the original precedence constrained problem in the sense that the numb...

When analyzing programs with parallel imperative constructs (e.g., cobegin/coend), standard computer intermediate representations are inadequate. This paper introduces a new relation called the precedence relation and new data structures called the Pamllel Control Flow Graph and Parallel Precedence Graphs for programs with parallel constructs. We show how to report anomalies in parallel program...

Causal precedence between biochemical interactions is crucial in the biomedical domain, because it transforms collections of individual interactions, e.g., bindings and phosphorylations, into the causal mechanisms needed to inform meaningful search and inference. Here, we analyze causal precedence in the biomedical domain as distinct from open-domain, temporal precedence. First, we describe a n...

A polynomial time algorithm is developed to decide the equivalence of an operator-precedence grammar with the underlying Floyd's operator-precedence parsing algorithm, a result of possible practical significance. As a consequence the necessary and sufficient condition for an operatorprecedence grammar to be the valid grammatical characterization of the underlying Floyd's operator-precedence par...