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.
In this chapter we present a new approach to reduce the examination time of MRI systems. The time reduction is accomplished by dividing MRI scans into segments, which are intermixed to reduce the MRI examination time. The intermixing algorithms are based on a scheduling framework. First, the concept of multiple scan sets (ExamCards) is introduced. Then an explicit definition of the algorithms for...
In Ramadge-Wonham supervisory control theory we often need to check nonconflict of plants and corresponding synthesized supervisors. For a large system such a check imposes a great computational challenge because of the complexity incurred by composition of plants and supervisors. In this paper we present a novel procedure based on automaton abstractions, which removes internal transitions of relevant...
In supervisor synthesis achieving nonblockingness is a major computational challenge for a large system. In the literature several automaton-based distributed synthesis approaches have been proposed, in which the plant is modeled by a collection of nondeterministic finite-state automata and the requirement and the final distributed supervisor are modeled by a collection of deterministic finite-state...
In this paper an approach to distributed timed supervisory based on aggregated synthesis is given. This paper formulates the distributed timed control problem and introduces a method for finding the distributed timed supervisor with the minimal makespan with reference to other supervisors synthesized with aggregated timed synthesis. The method is based on bottleneck optimization used in manufacturing...
In many practical applications we need to compute a nonblocking supervisor that not only complies with pre-specified safety requirements but also achieves a certain time optimal performance such as maximum throughput. In this paper we first present a minimum-makespan supervisor synthesis problem. Then we show that the problem can be solved by a terminable algorithm, where the execution time of each...
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.