In this paper, we further develop the coordination control scheme for discrete-event systems based on the Ramadge-Wonham framework. The notions of conditional decomposability, conditional controllability, and conditional closedness are revised and simplified, supremal conditionally controllable sublanguages of general non-prefix-closed languages are discussed, and a procedure for the computatio...

Imagine a universe, which is basically a set of points (that may be infinite), and a collection of sensors. Each sensor has a specified covering region in the universe, i.e, a subset of the universe which it covers (monitors). Moreover, the sensors are powered by battery and they have two alternating modes of action, active and passive. In active mode a sensor covers its region and in passive m...

We study the problem of deriving a specification for a third-party component, based on the specification of the system and the environment in which the component is supposed to reside. Particularly, we are interested in using component specifications for conformance testing of black-box components, using the theory of input-output conformance (ioco) testing. We propose and prove sufficient crit...

The rising interest around tractable Probabilistic Graphical Models is due to the guarantees on inference feasibility they provide. Among them, Cutset Networks (CNets) have recently been introduced as models embedding Pearl’s cutset conditioning algorithm in the form of weighted probabilistic model trees with tree-structured models as leaves. Learning the structure of CNets has been tackled as ...

Let A be a Hilbert-space operator satisfying the growth condition ||(z —/4) || < expi&[dist(z, /)]~SS, z //.where / is a C Jordan curve, and K > 0, s £ (0, 1) are two constants. Let T = A + B for some fi e C , I < p < oc. It is shown that T is strongly decomposable if and only if cr(T') does not fill the "interior" of /. 1, H. Radjavi and the author [13] showed that if a Hilbert-space operator ...

In this work we describe an algorithm that generates well constrained geometric constraint graphs which are solvable by the treedecomposition constructive technique. The algorithm is based on Henneberg constructions and would be of help in transforming underconstrained problems into well constrained problems as well as in exploring alternative constructions over a given set of geometric elements.