Mekatronik Mühendisliği Bölümü Yayın Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/255

Browse

Filters

2010 - 201711

Settings

Subject: search.filters.subject.Discrete Event Systems

Search Results

Now showing 1 - 10 of 11
  • Conference Object
    Citation - Scopus: 2
    Computation of Supervisors for Fault-Recovery and Repair for Discrete Event Systems
    (Univelt Inc., 2014) Sülek, A.N.; Schmidt, K.W.
    In this paper, we study the fault-recovery and repair of discrete event systems (DES). To this end, we first develop a new method for the fault-recovery of DES. In particular, we compute a fault-recovery supervisor that follows the specified nominal system behavior until a fault-occurrence, that continues its operation according to a degraded specification after a fault and that finally converges to a desired behavior after fault. We next show that our method is also applicable to system repair and we propose an iterative procedure that determines a supervisor for an arbitrary number of fault occurrences and system repairs. We demonstrate our method with a manufacturing system example. © IFAC.
  • Conference Object
    Computation of Projections for the Abstraction-Based Diagnosability Verification
    (IFAC Secretariat, 2010) Schmidt, K.
    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.
  • Conference Object
    Citation - Scopus: 8
    Computation of Fault-Tolerant Supervisors for Discrete Event Systems
    (IFAC Secretariat, 2013) Sülek, A.N.; Schmidt, K.W.
    Fault-tolerance addresses the problem of operating a system even in case of faults. In this paper, we study fault-tolerance in the supervisory control framework for discrete event systems (DES). We consider DES, where certain events might no longer be possible in case a fault happens. In this setting, we first identify necessary and suficient conditions for the existence of a supervisor that realizes a given behavioral specification both in the non-faulty and in the faulty case. We further show that it is possible to determine a supremal fault-tolerant sublanguage in case the existence condition is violated. Finally, we propose an algorithm for the computation of this sublanguage and prove its correctness. Different from existing work, our fault-tolerant supervisor allows fault occurrences and system repairs at any time. The concepts and results developed in this paper are illustrated by a manufacturing system example. © 2013 IFAC.
  • Conference Object
    Citation - Scopus: 12
    Applied Supervisory Control for a Flexible Manufacturing System
    (IFAC Secretariat, 2010) Moor, T.; Schmidt, K.; Perk, S.
    This paper presents a case study in the design and implementation of a discrete event system (DES) of real-world complexity. Our DES plant is a flexible manufacturing system (FMS) laboratory model that consists of 29 interacting components and is controlled via 107 digital signals. Regarding controller design, we apply a hierarchical and decentralised synthesis method from earlier work in order to achieve nonblocking and safe closed-loop behaviour. Regarding implementation, we discuss how digital signals translate to discrete events from a practical point of view, including timing issues. The paper demonstrates how both, design and implementation, are supported by the open-source software tool libFAUDES.
  • Conference Object
    Citation - Scopus: 5
    Abstraction-Based Supervisory Control for Recon-Gurable Manufacturing Systems
    (IFAC Secretariat, 2013) Khalid, H.M.; Kirik, M.S.; Schmidt, K.W.
    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. © 2013 IFAC.
  • Article
    Citation - WoS: 8
    Citation - Scopus: 8
    Reconfigurability of Behavioural Specifications for Manufacturing Systems
    (Taylor & Francis Ltd, 2017) Schmidt, Klaus Werner
    Reconfigurable manufacturing systems (RMS) support flexibility in the product variety and the configuration of the manufacturing system itself in order to enable quick adjustments to new products and production requirements. As a consequence, an essential feature of RMS is their ability to rapidly modify the control strategy during run-time. In this paper, the particular problem of changing the specified operation of a RMS, whose logical behaviour is modelled as a finite state automaton, is addressed. The notion of reconfigurability of specifications (RoS) is introduced and it is shown that the stated reconfiguration problem can be formulated as a controlled language convergence problem. In addition, algorithms for the verification of RoS and the construction of a reconfiguration supervisor are proposed. The supervisor is realised in a modular way which facilitates the extension by new configurations. Finally, it is shown that a supremal nonblocking and controllable strict subautomaton of the plant automaton that fulfils RoS exists in case RoS is violated for the plant automaton itself and an algorithm for the computation of this strict subautomaton is presented. The developed concepts and results are illustrated by a manufacturing cell example.
  • Article
    Citation - WoS: 9
    Citation - Scopus: 10
    Computation of Supervisors for Reconfigurable Machine Tools
    (Springer, 2015) Schmidt, Klaus Werner
    The rapid reconfiguration of manufacturing systems is an important issue in today's manufacturing technology in order to adjust the production to varying product demands and types. In this paper, we study the control of reconfigurable machine tools (RMTs) with the aim of fast reconfiguration and an easy controller implementation. We first formulate a particular reconfiguration problem for RMTs in a discrete event system setting, and then provide a necessary and sufficient condition for its solution. Moreover, we propose a polynomial-time algorithm for the construction of a reconfiguration supervisor as the composition of one modular supervisor for each separate RMT configuration. Each modular supervisor operates in three modes. In the first mode, it tracks the plant state if its corresponding configuration is inactive. In the second mode, it performs a configuration change if its corresponding configuration becomes active and in the third mode, it follows the specified behavior of its corresponding configuration if the configuration is active. An important property of the proposed reconfiguration supervisor is that it performs reconfigurations in a bounded number of event occurrences. In addition, the modular realization of our reconfiguration supervisor enables controller modifications such as adding or removing configurations during run-time. All results presented in the paper are illustrated by an RMT example.
  • Article
    Citation - WoS: 17
    Citation - Scopus: 20
    State Attraction Under Language Specification for the Reconfiguration of Discrete Event Systems
    (Ieee-inst Electrical Electronics Engineers inc, 2015) Nooruldeen, Anas; Schmidt, Klaus Werner
    In this note, we study a particular setting for the reconfiguration of discrete event systems (DES) that is applicable to the control of reconfigurable manufacturing systems (RMS). We consider DES that can operate in different configurations and we are interested in the realization of configuration changes. Different from previous work, we intend to reach a set of plant states where a new configuration can be started in a bounded number of transitions and at the same time fulfill a behavioral specification before starting the new configuration. To this end, we introduce the concept of weak attraction under language specification (WALS) and derive necessary and sufficient conditions for its verification. Using WALS, we propose a polynomial-time algorithm for computing a supervisor that performs the described configuration changes. We demonstrate the applicability of our method using a workcell of an RMS.
  • Article
    Citation - WoS: 5
    Citation - Scopus: 5
    Optimal Supervisory Control of Discrete Event Systems: Cyclicity and Interleaving of Tasks
    (Siam Publications, 2015) Schmidt, Klaus Werner
    A 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.
  • Article
    Citation - WoS: 54
    Citation - Scopus: 74
    Maximally Permissive Hierarchical Control of Decentralized Discrete Event Systems
    (Ieee-inst Electrical Electronics Engineers inc, 2011) Schmidt, Klaus; Breindl, Christian
    The subject of this paper is the synthesis of natural projections that serve as nonblocking and maximally permissive abstractions for the hierarchical and decentralized control of large-scale discrete event systems. To this end, existing concepts for nonblocking abstractions such as natural observers and marked string accepting (msa)-observers are extended by local control consistency (LCC) as a novel sufficient condition for maximal permissiveness. Furthermore, it is shown that, similar to the natural observer condition and the msa-observer condition, also LCC can be formulated in terms of a quasi-congruence. Based on existing algorithms in the literature, this allows to algorithmically compute natural projections that are either natural observers or msa-observers and that additionally fulfill LCC. The obtained results are illustrated by the synthesis of nonblocking and maximally permissive supervisors for a manufacturing system.