{"title":"Coordination control of discrete-event systems","authors":"J. Komenda, J. H. Schuppen","doi":"10.1109/WODES.2008.4605915","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605915","url":null,"abstract":"The concept of a coordinator is proposed for control of modular discrete-event systems. The coordinator makes all subsystems conditionally independent generators as defined in the paper. The coordinator receives part of the partial observations of the subsystems and its task is to satisfy the global part of the specification and of the nonblockingness. The complete supervisor then consists of the coordinator, its supervisor, and the local supervisors for the subsystems. An example of control of a distributed discrete-event system shows that a coordinator is necessary for achieving safety and nonblockingness.","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":"129189551","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":"libFAUDES — An open source C++ library for discrete event systems","authors":"T. Moor, K. Schmidt, S. Perk","doi":"10.1109/WODES.2008.4605933","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605933","url":null,"abstract":"The libFAUDES (Friedrich-Alexander University Discrete Event Systems) library is an open source C++ software library for discrete event systems (DES) that is developed at the University of Erlangen-Nuremberg. The core library supports methods for the DES analysis and supervisor synthesis, while a built-in plugin mechanism allows of specialized library extensions. In this paper, we evaluate libFAUDES according to the benchmark examples provided for the Workshop on Discrete Event Systems 2008.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"32 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":"131811732","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":"Max-plus algebra and max-plus linear discrete event systems: An introduction","authors":"B. Schutter, T. Boom","doi":"10.1109/WODES.2008.4605919","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605919","url":null,"abstract":"We provide an introduction to the max-plus algebra and explain how it can be used to model a specific class of discrete event systems with synchronization but no concurrency. Such systems are called max-plus linear discrete event systems because they can be described by a model that is ldquolinearrdquo in the max-plus algebra. We discuss some key properties of the max-plus algebra and indicate how these properties can be used to analyze the behavior of max-plus linear discrete event systems. We also briefly present some control approaches for max-plus linear discrete event systems, including model predictive control. Finally, we discuss some extensions of the max-plus algebra and of max-plus linear systems.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"299 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":"123657180","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":"Fault diagnosis with dynamic observers","authors":"F. Cassez, S. Tripakis","doi":"10.1109/WODES.2008.4605947","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605947","url":null,"abstract":"In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Dynamic observers can switch sensors on or off, thus dynamically changing the set of events they wish to observe. We study the dynamic diagnoser synthesis problem and some related optimization problems.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"190 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":"116279763","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":"Adaptive Petri Nets implementation. The execution time controller","authors":"R. P. Moreno, J. Salcedo","doi":"10.1109/WODES.2008.4605963","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605963","url":null,"abstract":"The reaction time of a controller is a fundamental matter in discrete event control systems. Petri nets are extensively used in this field. The controller reads the inputs, executes the control Petri net and writes the output in a cyclic manner. The reaction time of this controller depends on the Petri net structure, on the events sequence and on the algorithm that executes the net. With the objective of minimizing the reaction time, we decided to design a supervisor controller, which we have called execution time controller (ETC). The aim of the ETC is to determine in real time which algorithm executes the Petri net fastest and to change the execution algorithm when necessary. In the case of systems control, this minimizes the controller reaction time and also minimizes the power consumed by the controller. One possible application of the technique is the minimization of execution time of the programmable logic controllers programs developed in sequential function chart (SFC).","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"33 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":"124855225","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":"Fault diagnosis and identification of discrete event systems using Petri nets","authors":"M. P. Fanti, C. Seatzu","doi":"10.1109/WODES.2008.4605985","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605985","url":null,"abstract":"Fault diagnosis and identification of discrete event systems received considerable attention in the last decades. In this paper we present a survey of the state-of-the art of these topics within the framework of Petri nets.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"4 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":"123935305","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":"Velocity balancing in flexible manufacturing systems","authors":"A. Kobetski, Martin Fabian","doi":"10.1109/WODES.2008.4605972","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605972","url":null,"abstract":"Practical incentives motivate the development of optimal working schedules in manufacturing environments. Most often, such development is focused on time optimality issues, without concern for how the resulting schedules are executed. In practice, this often leads to an unnecessarily high amount of acceleration during a production cycle, which affects negatively the productive life of the manufacturing equipment. In this paper, we present and compare several methods to reduce the acceleration load in a production cell by processing a given working schedule, without compromising such features of the schedule as cycle time optimality, collision- and deadlock avoidance.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"51 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":"121043457","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":"Algebraic synthesis of transition conditions of a state model","authors":"Yann Hietter, J. Roussel, J. Lesage","doi":"10.1109/WODES.2008.4605943","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605943","url":null,"abstract":"The synthesis method presented in this paper has been developed to automatically design logic controllers. In this paper, we show how to use this approach in the specific case where a designer must derive a particular controller from a generic model. The instantiation of the model is completely achieved by an algebraic synthesis. To illustrate the approach, the example of a water supply system is used and the generic model of the controller is given under the form of a sequential function chart (SFC).","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"1 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":"130182725","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":"Scalable optimization algorithms for discrete event systems with real-time constraints: An overview of recent developments","authors":"Jianfeng Mao, C. Cassandras","doi":"10.1109/WODES.2008.4605937","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605937","url":null,"abstract":"Discrete event systems with real-time constraints involve tasks that must be completed within specified hard deadlines. Guaranteeing such constraints requires a control effort measured through a cost function, giving rise to a class of nonlinear optimization problems. We overview recent developments aimed at solving such problems in an efficient scalable fashion suitable for on-line applications with limited computational resources. We describe how structural properties of the optimal state trajectory in such problems can be exploited and present a critical task decomposition algorithm (CTDA) when tasks are processed by a single-stage system. When tasks are processed over multiple stages and are subject to end-to-end real-time constraints, a different set of structural properties is exploited leading to a virtual deadline algorithm (VDA).","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"9 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":"126856546","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":"A topological perspective on diagnosis","authors":"A. Bauer, S. Pinchinat","doi":"10.1109/WODES.2008.4605948","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605948","url":null,"abstract":"We propose a topological perspective on the diagnosis problem for discrete-event systems. In an infinitary framework, we argue that the construction of a centralized diagnoser is conditioned by two fundamental properties: saturation and openness. We show that these properties are decidable for omega-regular languages. Usually, openness is guaranteed implicitly in practical settings. In contrast to this, we prove that the saturation problem is PSPACE-complete, which is relevant for the overall complexity of diagnosis.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"14 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":"134216270","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}