We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that t...
Louis J. Billera, Samuel K. Hsiao, J. Scott Provan
Abstract. We consider a generalized form of the conventional decentralized control architecture for discreteevent systems where the control actions of a set of supervisors can be `...
Requirements elicitation involves the construction of large sets of conceptual models. An important step in the analysis of these models is checking their consistency. Existing re...
Classical consistency degree has some limitations for measuring the consistency of a decision table, in which the lower approximation of a target decision is only taken into consi...