{"title":"A generic approach to build plant models for DES verification purposes","authors":"José Machado, B. Denis, J. Lesage","doi":"10.1109/WODES.2006.382508","DOIUrl":"https://doi.org/10.1109/WODES.2006.382508","url":null,"abstract":"The modeling of plant behavior is often essential in the design, performance analysis or diagnosis of discrete event systems (DES). Yet this task remains a difficult one for which little research has been devoted. In this paper, we propose a technique for building behavioral models specific to large-scale plants, in order to perform a formal verification of the controller by means of \"model-checking\". In this aim, we have opted to use a modular approach with an appropriate class of automata. To obtain the overall plant model, parallel evolutions of the elementary automata are to be coordinated by a sequencer that ensures consistency of these evolutions","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"1 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":"122296854","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":"Efficient solution for the state avoidance control problem on concurrent systems using a disjunctive architecture","authors":"B. Gaudin","doi":"10.1109/WODES.2006.1678410","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678410","url":null,"abstract":"This work investigates the problem of synthesizing supervisors which ensure some particular states of a discrete event system (DES) to be avoided. The systems under consideration are concurrent: they consist of several subsystems running in parallel. In this case, general supervisory control methodologies can not be applied because of complexity. The disjunctive architecture as well as a new controllability definition are here used to efficiently provide a solution to the state avoidance problem on concurrent systems","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"7 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":"125197392","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":"Modular nonblocking verification using conflict equivalence","authors":"H. Flordal, R. Malik","doi":"10.1109/WODES.2006.1678415","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678415","url":null,"abstract":"This paper proposes a modular approach to verifying whether a large discrete event system is nonconflicting. The new approach avoids computing the synchronous product of a large set of finite-state machines. Instead, the synchronous product is computed gradually, and intermediate results are simplified using conflict-preserving abstractions based on process-algebraic results about fair testing. Heuristics are used to choose between different possible abstractions. Experimental results show that the method is applicable to finite-state machine models of industrial scale and brings considerable improvements in performance over other methods","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"10 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":"125234153","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":"Generalized Language Measure of Finite State Logical Systems","authors":"I. Chattopadhyay, A. Ray","doi":"10.1109/WODES.2006.382395","DOIUrl":"https://doi.org/10.1109/WODES.2006.382395","url":null,"abstract":"The signed real measure of regular languages has been introduced and validated in recent literature for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems. This paper reports several generalizations of the language measure, which are applicable to synthesis of optimal discrete event supervisory control. These generalizations eliminate a user-selectable parameter in the original concept of language measure. The concepts are illustrated with simple examples","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"37 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":"125112445","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":"DECADA: Tool for Discrete-Event Control and Diagnosis Analysis","authors":"G. Stamp, Y. Ong, R. Kumar, C. Zhou","doi":"10.1109/WODES.2006.382404","DOIUrl":"https://doi.org/10.1109/WODES.2006.382404","url":null,"abstract":"We introduce a tool for analyzing the control and diagnosis issues in discrete-event systems. The tool consists of a program written in C that accepts command line arguments and a GUI front end written in Java that can be used to execute the command line driven program. The tool accepts models of underlying systems and specifications in form of finite automata and supports various automata-level computations as well as control and diagnosis related verification and synthesis. We describe the way the tool is structured and the way it can be used","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"25 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":"128870368","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":"Optimal Resources Allocation for a Hybrid Material Handling System in a 300mm Wafer Fab","authors":"Chih-Ming Liu, C. Kuo, Pei-lun Chang","doi":"10.1109/WODES.2006.1678413","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678413","url":null,"abstract":"This paper addresses the issue of the optimal resources allocation of automated material handling systems (AMHS) and operators for a hybrid material handing system in a 300-mm wafer fab. The proposed methodology exploits the colored timed Petri nets (CTPN) to model the hybrid material handing system, and then the CTPN model is further transformed into a three-phase discrete event simulation model for the performance analysis of the system. The experiment design is conducted to simulate different scenarios and the response surface method is applied to obtain the optimal allocation of AMHSs and operators for each scenario","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"1 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":"129633956","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":"Identification of deterministic Petri nets","authors":"M. P. Cabasino, A. Giua, C. Seatzu","doi":"10.1109/WODES.2006.382527","DOIUrl":"https://doi.org/10.1109/WODES.2006.382527","url":null,"abstract":"In a previous paper we presented an approach to identify a Petri net system, given a finite language that it generates. The set of transitions and the number of places is assumed to be known, while the net structure and the initial marking are computed solving an integer programming problem. In this paper we extend this approach in two ways. Firstly, we consider the case in which the number of places of the net is not given but only an upper bound on its value is known. Secondly, we show how the approach can be extended to the case of deterministic labeled Petri nets, where two or more transitions may share the same label. In particular, in this case we impose that the resulting net system is deterministic. In both cases the identification problem can still be solved via an integer programming problem","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"1 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":"129897139","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 Trellis Notion for Distributed System Diagnosis with Sequential Semantics","authors":"Eric Fabre, C. Hadjicostis","doi":"10.1109/WODES.2006.1678445","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678445","url":null,"abstract":"We consider modular automata, obtained as a product of elementary components, and adopt the usual sequential semantics: runs of these systems are sequences of events (in contrast to partial orders). The set of all runs of an automaton can be described by a trellis, which forms the support of many recursive estimation or decision algorithms. In this paper, we revise this notion to adapt it to the case of modular automata, and obtain a factorization property on this revised trellis. This factorization opens the way to distributed estimation algorithms that were described up to now in partial order semantics","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"34 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":"128918150","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":"Control synthesis for P-temporal event graphs","authors":"Ouerghi Iteb, Hardouin Laurent","doi":"10.1109/WODES.2006.1678435","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678435","url":null,"abstract":"P-temporal Petri nets are convenient tools to model manufacturing systems whose activity times are included between a minimum and a maximum value. The typical feature of these nets is that a control of the firing dates of the transitions is required for the controlled system to behave as close as possible to the specified outputs and to ensure the liveness of tokens, when possible. This paper aims at designing a control law which is obtained by using residuated and dual residuated mappings. An example is given to illustrate the proposed approach","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"15 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120967838","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":"Automatic alarm handling generation for industrial automation systems","authors":"A. Castelnuovo, L. Ferrarini","doi":"10.1109/WODES.2006.1678429","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678429","url":null,"abstract":"The alarm handling, performed in a modular formal design, is considered in the context of the industrial automation systems. The aim is to provide a methodology based on the formal modeling of the logic control functions able to generate alarm events whenever a generic fault occurs. Furthermore the control system is automatically endowed with the capability to identify the faults and recover them, by an alarm event analysis. The identification problem is faced here by a comparison between the expected and actual sensor values, for every possible state of the controlled equipment. The main contribution of the paper consists of the automatic synthesis algorithm for the alarm handling. Although the approach has only been developed for the pallet transportation system for machining centers, the results can be easily extended to the overall system. The modular finite state machine approach has been adopted here for the modeling of the control modules","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"54 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":"121347090","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}