The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The task of failure prognosis requires the prediction of impending failures. This is possible if each failure trace possesses a nonfailure prefix for which at least one local prognoser is unambiguous that a failure in future is inevitable. This paper formulates and studies the problem of distributed prognosis of discrete event systems, where the local prognosers exchange their observations of the...
Most prior work on control of discrete event systems assume that sensors are reliable so that they can be modeled as a deterministic (point-valued) observation mask. However in certain harsh environments such as nuclear systems, sensors may not be reliable. This results in a nondeterministic (set-valued) observation mask. In this paper, we allow the observation mask to be nondeterministic to capture...
We address the problem of optimizing mediator-based service composition where the services and the desired composition (goal) functionality are represented as i/o automata with loops. The objective of optimization is to minimize the costs of communications and computations necessary to realize the goal from the existing services. We develop an algorithm to compute the minimum cost of an automaton...
We develop a modeling approach for Simulink diagrams. Simulink is a commercial graphical representation tool for representing and simulating dynamical systems. We propose a recursive approach for modeling a class of Simulink diagrams as input/output-extended finite automata (I/O-EFA). A model of a Simulink diagram can be used for further analysis such as test generation and formal verification. The...
We study the problem of finding a finite bisimilar abstraction for a class of reactive untimed infinite-state systems, modeled as input-output extended finite automata (I/O-EFA). We identify a lower bound abstraction (that is coarser than any finite bisimilar abstraction), and present an iterative refinement algorithm whose termination guarantees the existence of a finite bisimilar abstraction. The...
Keeping a property of system behaviors secret from an observer (who has a partial observation of any executed behavior) requires that the execution of any property-satisfying or property-violating behavior must not become known to the observer. When an observer does not know the exact behaviors of a system it observes, a weaker notion of secrecy can be defined, which we introduce in this paper. We...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.