Çankaya GCRIS Standart veritabanının içerik oluşturulması ve kurulumu Research Ecosystems (https://www.researchecosystems.com) tarafından devam etmektedir. Bu süreçte gördüğünüz verilerde eksikler olabilir.

Mekatronik Mühendisliği Bölümü

Permanent URI for this communityhttps://hdl.handle.net/20.500.12416/20

Browse

Browsing Mekatronik Mühendisliği Bölümü by Subject "Abstraction"

Filter results by typing the first few letters
Now showing 1 - 4 of 4
  • Thumbnail Image
    Conference Object
    Citation Count: Khalid, H.M.; Kirik, M.S.; Schmidt, K.W., "Abstraction-Based Supervisory Control for Recon-Gurable Manufacturing Systems?", Ifac Proceedings Volumes (Ifac-Papersonline), Vol. 4, No. 1, pp. 157-162, (2013).
    Abstraction-Based Supervisory Control for Recon-Gurable Manufacturing Systems?
    (2013) Khalid, Harith M.; Kırık, Mustafa Sancay; Schmidt, Klaus Werner; 271229
    Reconfiguration control for discrete event systems (DES) is concerned with the realization of different system configurations by modification of the supervisory control loop. In this paper, we study the reconfiguration supervisor design for reconfigurable manufacturing systems (RMS) that comprise multiple components. We construct a modular supervisor for each configuration and system component in order to realize each active configuration and to quickly change between configurations. Different from the existing literature that is focused on monolithic design, our method is abstraction-based, and, hence applicable to large-scale DES.
  • Thumbnail Image
    Conference Object
    Citation Count: Schmidt K.,"Computation of Projections for the Abstraction-Based Diagnosability Verification",Ifac Proceedings Volumes (Ifac-Papersonline), Vol. 10, No. 1, pp. 199-204, (2011).
    Computation of Projections for the Abstraction-Based Diagnosability Verification
    (2011) Schmidt, Klaus Werner
    The verification of language-diagnosability (LD) for discrete event systems (DES) generally requires the explicit evaluation of the overall system model which is infeasible for practical systems. In order to circumvent this problem, our previous work proposes the abstraction-based LD verification using natural projections that fulfill the loop-preserving observer (LPO) property. In this paper, we develop algorithms for the verification and computation of such natural projections. We first present a polynomial-time algorithm that allows to test if a given natural projection is a loop-preserving observer. Then, we show that, in case the LPO property is violated, finding a minimal extension of the projection alphabet such that the LPO condition holds is NP-hard. Finally, we adapt a polynomial-time heuristic algorithm by Feng and Wonham for the efficient computation of loop-preserving observers.
  • Thumbnail Image
    Article
    Citation Count: Schmidt, K.W., Ribeiro Cury, J.E. (2012). Efficient abstractions for the supervisory control of modular discrete event systems. IEEE Transactions On Automatic Control, 57(12), 3224-3229. http://dx.doi.org/10.1109/TAC.2012.2200373
    Efficient abstractions for the supervisory control of modular discrete event systems
    (IEEE-Inst Electrical Electronics Engineers Inc, 2012) Schmidt, Klaus Werner; Ribeiro Cury, Jose Eduardo; 17337
    The topic of this technical note is the nonblocking and maximally permissive abstraction-based supervisory control for modular discrete event systems (DES). It is shown, that an efficient abstraction technique, that was developed for the nonconflict verification of modular DES, is also suitable for the nonblocking supervisory control. Moreover, it is proved that this abstraction technique can be extended by the condition of local control consistency, in order to achieve maximally permissive supervision. Different from existing approaches, the presented abstraction does not require to preserve the shared events among the system components in the respective abstraction alphabets, and hence leads to potentially smaller system abstractions. The obtained results are illustrated by a flexible manufacturing system example.
  • Thumbnail Image
    Article
    Citation Count: Schmidt, K.W. (2013). Verification of modular diagnosability with local specifications for discrete-event systems. IEEE Transactions on Systems Man Cybernetics Systems, 43(5), 1130-1140. http://dx.doi.org/10.1109/TSMCA.2012.2227251
    Verification of modular diagnosability with local specifications for discrete-event systems
    (IEEE-Inst Electrical Electronics Engineers Inc, 2013) Schmidt, Klaus Werner; 17337
    In 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.