{"title":"On maximal permissiveness of hierarchical and modular supervisory control approaches for discrete event systems","authors":"Klaus Werner Schmidt, Christian Breindl","doi":"10.1109/WODES.2008.4605990","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605990","url":null,"abstract":"Recently, several efficient modular and hierarchical approaches for the control of discrete event systems (DES) have been proposed. Although these methods are very suitable for dealing with the state space explosion problem, their common limitation is that either maximal permissiveness is not addressed or unnecessarily restrictive conditions are required in order to ensure maximally permissive control. In this paper we develop a unified framework for the investigation of maximal permissiveness of modular control in multi-level hierarchies.We identify a set of conditions that is met by several approaches, and prove its sufficiency for maximally permissive control.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128607805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modelling automation systems by UML and Petri Nets","authors":"F. Basile, P. Chiacchio, D. Del Grosso","doi":"10.1109/WODES.2008.4605964","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605964","url":null,"abstract":"A two-stage modelling approach for distributed control of automation systems is described in this paper. At first, the drawing of several UML diagrams is proposed to semi-formally model the system to be controlled, and to describe requirements for the control system. Then, it is suggested to obtain a PN model of the plant and of the controller from UML by applying a set of domain transformation rules so that in PN domain the closed loop behavior can be more properly analyzed and refined. A real case study is used to show the effectiveness of the approach.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129836245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Asymptotic minimal communication for decentralized discrete-event control","authors":"S. Ricker","doi":"10.1109/WODES.2008.4605994","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605994","url":null,"abstract":"Algorithms for finding minimal communication policies for decentralized discrete-event control use the following notion for optimality: remove any one of the elements from the communication set and either the control problem can no longer be solved correctly or a condition of observational equivalence is violated. In contrast, a strategy for finding a globally optimal communication policy, based not on structural properties of the system, but rather, in a behavioral sense, is presented. The problem of finding a minimal communication set is reduced to an optimization problem for a set of Markov chains.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130109241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Lai, D. Nessi, M. P. Cabasino, A. Giua, C. Seatzu
{"title":"A comparison between two diagnostic tools based on automata and Petri nets","authors":"S. Lai, D. Nessi, M. P. Cabasino, A. Giua, C. Seatzu","doi":"10.1109/WODES.2008.4605936","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605936","url":null,"abstract":"In this paper we consider two diagnosis procedures for discrete event systems based respectively on automata and Petri nets. First we compare them in terms of applicability and generality. Secondly, we apply them to the WODES diagnosis benchmark and compare them in terms of computational complexity. As a result we conclude that the automata procedure is more general, but the Petri net approach presents significant advantages in terms of computational complexity.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122868332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Membrane systems in systems biology","authors":"D. Besozzi, G. Mauri, D. Pescini, C. Zandron","doi":"10.1109/WODES.2008.4605959","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605959","url":null,"abstract":"Membrane systems were introduced by Gh. Paun in 1998 as a class of distributed parallel computing devices of biochemical type, inspired from the functioning of living cells. Since then, they have been the subject of various studies, aimed at investigating and point out many aspects related to their computational power and efficiency. More recently, the model has been applied within the field of systems biology, for the modelling of complex biological systems and the analysis of their dynamics. In this paper, we present a class of membrane systems where probabilities (dynamically changing in time) are associated with the rules governing the evolution of the system, and we show how this model can be used to describe an oscillating process, the Belousov-Zhabotinskii reaction. Then, we discuss about the recent extensions of this model and its latest applications.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131639020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"State identification problems for input/output transition systems","authors":"S. Bensalem, M. Krichen, S. Tripakis","doi":"10.1109/WODES.2008.4605949","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605949","url":null,"abstract":"A well-established theory exists for testing finite-state machines, in particular Moore and Mealy machines. A fundamental class of problems handled by this theory is state identification: we are given a machine with known state space and transition relation but unknown initial state, and we are asked to find experiments which permit to identify the initial or final state of the machine, called distinguishing and homing experiments, respectively. In this paper, we study state identification for input/output transition systems. An input/output transition system is a finite state machine each edge of which is labelled with either an input or an output action. We propose a method to transform such a system into a Mealy machine. By existing methods, we build an input/output experiment which is a solution for the identification problems for the obtained Mealy machine. A solution for the identification problems for the original system is then extracted.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131796001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Supervisory control of DES with distinguishing sensors","authors":"G. Bouzon, M.H. de Queiroz, J. Cury","doi":"10.1109/WODES.2008.4605917","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605917","url":null,"abstract":"This paper deals with supervisory control of discrete event systems with the introduction of sensors that distinguish certain occurrences of observable events. Distinguishing sensors are formally represented by an entity named distinguisher that maps the original events into disjoint sets of refined events and specify which of them could actually occur according to the evolution of the system. The control problem is formulated to incorporate distinguishers in order to have specifications that are presumably more easily modeled in the refined alphabet. It is proved that minimally restrictive nonblocking supervisors can be obtained by incorporating the distinguisher in the plant model. Further it is shown that suboptimal solutions can be efficiently obtained from an external approximation of the refined plant. Conditions for optimality are provided together with a polynomial complexity algorithm to verify them. A manufacturing system example illustrates the results.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115084142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reactive control system design using the Supervisory Control Theory: Evaluation of possibilities and limits","authors":"Matteo Cantarelli, J. Roussel","doi":"10.1109/WODES.2008.4605945","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605945","url":null,"abstract":"This paper presents a method to obtain programs to control an industrial equipment using the supervisory control theory (SCT). The presented approach is based on high detailed process models. A model of the interactions between the control unit and the process is also included in the plant model to facilitate the extraction of the controller behavior from the supervisor. An approach to obtain from the supervisor a controller straightforwardly implementable and then to automatically generate the control unit program is provided. The method presented in this paper has been tested on several case studies (from specifications to test with a real process). A dimensional summary of two of them is presented in the last section.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114263737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IPA for flow-control fluid queues with delays","authors":"R. Adams, Y. Wardi","doi":"10.1109/WODES.2008.4605927","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605927","url":null,"abstract":"This paper concerns the application of Infinitesimal Perturbation Analysis (IPA) to a fluid queue with flow control. The control law restricts the inflow rate to the queue by an amount that is proportional to the loss rate, and the control signal incurs a delay. The performance measure consists of a weighted sum of the loss volume and cumulative workload, and it is treated as a function of the buffer limit. The IPA derivative is derived, and its use in optimization is demonstrated via a simulation example. Published results on IPA for flow-control systems assume that the control signal is instantaneous, and the main contribution of this paper is in a technique for analysis of a system with delayed control. The derivation of the IPA derivative for the loss volume is presented in detail, and analogous results for the cumulative workload are highlighted.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114347709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Controller synthesis for an I/O-Based hierarchical system architecture","authors":"S. Perk, T. Moor, K. Schmidt","doi":"10.1109/WODES.2008.4605992","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605992","url":null,"abstract":"In our previous work, a framework for the hierarchical design of discrete event systems has been introduced that is based on a notion of inputs and outputs. I/O-plant models describe the interaction of each subsystem with the operator (or controller) and the environment. By alternation of subsystem composition and controller synthesis, a hierarchy of controllers is obtained that complements a hierarchy of environment models. An admissibility condition was presented that implies liveness while allowing for abstraction-based control. In this paper, we address the according controller synthesis problem and present an algorithmic synthesis procedure that respects admissibility and yields a solution to this problem. We illustrate our statements by the conceptional application example of a transport unit.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123703604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}