{"title":"Symbolic Synthesis and Verification of Hierarchical Interface-based Supervisory Control","authors":"Raoguang Song, R. Leduc","doi":"10.1109/WODES.2006.382510","DOIUrl":"https://doi.org/10.1109/WODES.2006.382510","url":null,"abstract":"Hierarchical interface-based supervisory control (HISC) decomposes a discrete-event system (DES) into a high-level subsystem which communicates with n ges 1 low-level subsystems, through separate interfaces which restrict the interaction of the subsystems. It provides a set of local conditions that can be used to verify global conditions such as nonblocking and controllability. The current HISC verification and synthesis algorithms are based upon explicit state and transition listings which limit the size of a given level to about 107 states when 1GB of memory is used. In this paper, we extend the HISC approach by introducing a set of predicate based fixed point operators that allow us to do a per level synthesis to construct for each level a maximally permissive supervisor that satisfies the corresponding HISC conditions. We prove that these fixpoint operators compute the required level-wise supremal languages. We then present algorithms that implement the fixpoint operators. Based on these algorithms, a symbolic implementation is briefly discussed which can be implemented using binary decision diagrams. We also discuss a method to implement our synthesized supervisors in a more compact manner. A large manufacturing system example (worst case state space on the order of 1030) extended from the ALP example is briefly discussed. The example showed that we can now handle a given level with a statespace as large as 10 15 states, using less than 160MB of memory. This represents a significant improvement in the size of systems that can be handled by the HISC approach. A software tool for synthesis and verification of HISC systems using our approach was also developed","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131619600","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 new method for centralized and modular supervisory control of real-time discrete event systems","authors":"L. Ouedraogo, M. Nourelfath, A. Khoumsi","doi":"10.1109/WODES.2006.1678426","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678426","url":null,"abstract":"In this paper, we first propose a centralized method for the synthesis of a supervisor that forces a given plant to conform to a given specification. Then, we extend this centralized method to the modular case, that is, for the synthesis of n supervisors that force the plant to conform to n given specifications, respectively. Timed automata (TA) with invariants is the model used to describe the plant and the specifications, and the synthesis approach is based on a transformation of TA into particular finite state automata called set-exp-automata","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123860486","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":"Spectool 2.4 Beta: A research tool for modular modeling, analysis, and synthesis of discrete event systems.","authors":"D. Shewa, J. Ashley, L. Holloway","doi":"10.1109/WODES.2006.382524","DOIUrl":"https://doi.org/10.1109/WODES.2006.382524","url":null,"abstract":"Condition systems are an excellent choice for the modeling and analysis of distributed systems. A condition system is a distributed Petri net where the distributed models communicate via state-based condition signals. In this paper the salient points of Spectool 2.4 Beta are presented. Spectool 2.4 Beta is a new release of our condition system modeling, analysis, and control synthesis tool. The paper begins with a brief review of our work using condition systems. We then present the features of this tool","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122642790","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}
Mabia Daniel-Cavalcante, Mauricio Ferreira Magalhães, R. Santos-Mendes
{"title":"The Max-Plus Algebra and the Network Calculus","authors":"Mabia Daniel-Cavalcante, Mauricio Ferreira Magalhães, R. Santos-Mendes","doi":"10.1109/WODES.2006.382512","DOIUrl":"https://doi.org/10.1109/WODES.2006.382512","url":null,"abstract":"Discrete event dynamic systems (DEDS) are systems whose state transitions are triggered by events that occur at discrete instants of time. The communication networks are examples of this kind of systems. The mathematical constraints of some DEDS can be described more adequately using the max-plus algebra. Previous works show that the problem of determining performance bounds for communication networks is simplified if modeled using this algebra. The compilation of existing rules and results on this field is called network calculus. The goal of this article is to improve a systematic use of the max-plus algebra in the formulation and derivation of results on network calculus. To illustrate the introduced methodology, we analyze a window flow controller, a system that controls the traffic admitted by a network in order to limit its backlog in a specified manner","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128608785","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":"DESUMA: A Tool Integrating GIDDES and UMDES","authors":"L. Ricker, S. Lafortune, S. Gene","doi":"10.1109/WODES.2006.382402","DOIUrl":"https://doi.org/10.1109/WODES.2006.382402","url":null,"abstract":"The key features of the software tool DESUMA for the study of discrete event systems modeled by finite-state automata are highlighted. DESUMA is the tool resulting from the integration of the UMDES library of routines for the study of discrete event systems (developed at the University of Michigan) within the graphical environment for visualizing discrete event systems (developed at Mount Allison University)","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"80 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124712586","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":"Decentralized Diagnosis for Nonfailures of Discrete Event Systems Using Inference-Based Ambiguity Management","authors":"S. Takai, R. Kumar","doi":"10.1109/WODES.2006.1678437","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678437","url":null,"abstract":"The task of decentralized decision-making involves interaction of a set of local decision-makers, each of which operates under limited sensing capabilities and is thus subjected to ambiguity during the process of decision-making. In a prior work (Kumar and Takai, 2005) we made an observation that such ambiguities are of differing gradations and presented a framework for inferencing over various local control decisions of varying ambiguity levels to arrive at a global control decision. A similar inferencing-based framework for the management of ambiguities in the decentralized diagnosis of failures was reported in Kumar and Takai (2006). The present paper extends this to the decentralized diagnosis of nonfailures which requires that any ambiguity about the non-occurrence of a failure be resolved within a uniformly bounded delay. As shown in this paper, the decentralized diagnosability for failures does not imply that for nonfailures, and vice-versa. So a different formulation is needed. In order to characterize the class of systems for which the ambiguity about the non-occurrence of a failure can be resolved within a uniformly bounded delay, we introduce the notion of n-inference diagnosability for nonfailures (also called n-inference NF-diagnosability), where the index n represents the maximum ambiguity level of any winning local decision. We present an algorithm for the verification of n-inference NF-diagnosability, and also establish various properties of it","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127473110","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":"Safety Control Synthesis for Time Petri Nets","authors":"G. Gardey, O.E. Roux, O. Roux","doi":"10.1109/WODES.2006.1678434","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678434","url":null,"abstract":"We study some control synthesis problems on an extension of time Petri nets that model a plant and its environment. The time Petri net control model both represents controllable and uncontrollable events, the problem is then to design a function (controller) such that a given property is fulfilled. We focus our analysis on safety properties expressed on the markings of the net and we propose a symbolic method to decide the existence of a controller that ensures these properties. Unlike existing methods on time Petri nets, that assume the net is bounded, the method is applicable for any time Petri nets. A consequence is that it is possible to decide the existence of a controller that k-bounds the plant. A method is then proposed to build a state-based controller and problems raised by the implementation (Zenoness, sampling) of the control function on the plant are discussed","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114857541","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":"Probabilistic failure diagnosis in finite state machines under unreliable observations","authors":"E. Athanasopoulou, Lingxi Li, C. Hadjicostis","doi":"10.1109/WODES.2006.1678446","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678446","url":null,"abstract":"In this paper we develop a probabilistic methodology for calculating the likelihood that an observed, possibly corrupted event sequence was generated by two (or more) candidate finite state machines (FSMs) (one of which could represent the normal mode of operation and the other(s) could represent the failed model(s)). Our objective is to perform failure diagnosis by deciding which FSM is most likely to have generated the observed event sequence. The underlying problem relates to the evaluation problem in hidden Markov models (HMMs) which calculates the probability that an observed sequence is generated by a given Markov model. However, the additional challenge in our setup is the fact that errors may corrupt the observed sequence, potentially causing loops in the resulting trellis diagram. These errors include, in their most basic form, event insertions and deletions and could arise under a variety of conditions (e.g., due to sensor failures or due to problems encountered in the links connecting the system sensors with the diagnoser). Given the possibly erroneous observed sequence, we propose an algorithm for obtaining the most likely underlying FSM","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131102710","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}
Haithem Derbel, M. Yeddes, N. Hadj-Alouane, H. Alla
{"title":"Diagnosis of a Class of Timed Discrete Event Systems","authors":"Haithem Derbel, M. Yeddes, N. Hadj-Alouane, H. Alla","doi":"10.1109/WODES.2006.1678439","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678439","url":null,"abstract":"A timed extension of the discrete-event systems failure diagnosis approach of Sampath et al. (1995) is proposed. The diagnoser is a timed automaton, constructed off-line, from a timed automaton system model. The construction procedure is illustrated through a practical example. A notion of Delta-diagnosability for timed languages, is defined. Necessary and sufficient conditions linking Delta-diagnosability, to the structure of a constructed diagnoser are given","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130401823","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":"On the reachability and nonblocking properties for parameterized discrete event systems","authors":"H. Bherer, J. Desharnais, R. St.-Denis","doi":"10.1109/WODES.2006.1678417","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678417","url":null,"abstract":"This paper presents procedures to determine if the reachability and nonblocking properties are violated for parameterized discrete event systems, consisting of n similar processes under total observation, in the state-based formulation of the supervisory control theory. Checking these properties is intrinsically a global problem, and the introduction of a parameter presents a new challenge","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134578474","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}