Scopus İndeksli Yayınlar Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/8651
Browse
3 results
Search Results
Article Citation - WoS: 16Citation - Scopus: 18Verification of Modular Diagnosability With Local Specifications for Discrete-Event Systems(Ieee-inst Electrical Electronics Engineers inc, 2013) Schmidt, Klaus WernerIn this paper, we study the diagnosability verification for modular discrete-event systems (DESs), i.e., DESs that are composed of multiple components. We focus on a particular modular architecture, where each fault in the system must be uniquely identified by the modular component where it occurs and solely based on event observations of that component. Hence, all diagnostic computations for faults to be detected in this architecture can be performed locally on the respective modular component, and the obtained diagnosis information is only relevant for that component. We define the condition of modular language diagnosability with local specifications (MDLS) in order to capture that each fault can indeed be detected in this modular architecture. Then, we show that MDLS can be formulated as a specific language-diagnosability problem. As the main contribution of this paper, we develop an incremental abstraction-based approach for the verification of MDLS, which is based on projections that fulfill the loop-preserving observer condition. In particular, our approach efficiently avoids the construction of a global system model, which is infeasible for systems of realistic size. Furthermore, we do not rely on the assumption of a live global plant, which is prevalent in previous diagnosability methods for modular DESs. We illustrate our approach and its computational savings by a manufacturing system example.Article Citation - WoS: 20Citation - Scopus: 20Robust Priority Assignments for Extending Existing Controller Area Network Applications(Ieee-inst Electrical Electronics Engineers inc, 2014) Schmidt, Klaus WernerThe usage of the controller area network (CAN) as an in-vehicle communication bus requires finding feasible and robust priority orders such that each message transmitted on the bus meets its specified deadline and tolerates potential transmission errors. Although such priority orders can be determined by available algorithms whenever they exist, it is always assumed that a CAN priority order is computed from scratch. In practical applications, it is frequently necessary to extend an existing message set by new messages. In this case, a feasible priority order that retains the standardized IDs of the existing messages and assigns suitable priorities to the new messages needs to be found. This paper proposes an algorithm for the computation of robust priority orders that solves the stated problem of extending existing message sets. First, bounds for the priorities of new messages are determined and then the most robust priority order that keeps the IDs of the existing messages is computed. The obtained algorithms are proved to yield correct results and are illustrated by detailed scheduling examples.Article Citation - WoS: 5Citation - Scopus: 5Optimal Supervisory Control of Discrete Event Systems: Cyclicity and Interleaving of Tasks(Siam Publications, 2015) Schmidt, Klaus WernerA substantial number of tasks in production systems are executed in a repetitive, cyclic fashion. Specifically, production systems run different production cycles of different products as well as different instances of the same production cycle. In this paper, we consider the optimal control and interleaving of such production cycles in a supervisory control framework for discrete event systems (DESs). That is, different from other approaches, our work is based on a behavioral specification of each production cycle. First, we adapt an optimal control approach for DESs, in order to optimize the operation of individual production cycles. Second, we employ the interleaving composition to design a supervisor that enables the simultaneous execution of different production cycles. Combining both results, we can further determine the maximum number of production cycles that can be executed simultaneously on a given production system.