Search

Some orders can be represented by translating convex figures in the plane. It is proved thatN-free and interval orders admit such representations with an unbounded number of directions. Weak orders, tree-like orders and two-dimensional orders of height one are shown to be two- directional. In all cases line segments can be used as convex sets.

A fundamental problem in debugging and monitoring distributed computations is to detect whether a state of the system satisfies some predicate. Cooper and Marzullo defined this problem as Possibly(Φ).

N-Free posets have recently taken some importance and motivated many studies. This class of posets introduced by Grillet [8] and Heuchenne [11] are very related to another important class of posets, namely the series-parallel posets, introduced by Lawler [12] and studied by Valdes et al. [21]. This paper shows how N-free posets can be considered as generalizations of series-parallel posets, by giving a recursive construction of N-free posets. Furthermore we propose a linear time algorithm to recognize and decompose any N-free poset. This yields some very naturel problems, namely: which are the properties(such as linear time algorithm for some invariant) of series-parallel posets that are kept for N-free posets?

In this note we prove that any finite interval order P can be represented in the plane by using translations of line segments, each one having a single direction of motion. We state that |Succ(P)| different directions are sufficient.