Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lo...
Nicholas Georgiou, Malgorzata Kuchta, Michal Moray...
The aim of the present paper is to investigate the half-spaces in the convexity structure of all quasiorders on a given set and to use them in an alternative approach to the dimens...
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
Partially ordered sets, causets, partially ordered spaces and their local counterparts are now often used to model systems in computer science and theoretical physics. The order mo...
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
Fixed point calculus is about the solution of recursive equations de˛ned by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of ˛xed ...
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...