{"title":"Discrete Event and Hybrid System Simulation with SimEvents","authors":"Michael I. Clune, P. Mosterman, C. Cassandras","doi":"10.1109/WODES.2006.382398","DOIUrl":"https://doi.org/10.1109/WODES.2006.382398","url":null,"abstract":"A new simulation product for discrete event and hybrid systems is overviewed and some examples of application areas where it can be used are brie y described.","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"88 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":"121352153","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 control-loop detection","authors":"Petra Malik, R. Malik","doi":"10.1109/WODES.2006.1678418","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678418","url":null,"abstract":"This paper presents an efficient algorithm to detect control-loops in large finite-state systems. The proposed algorithm exploits the modular structure present in many models of practical relevance, and often successfully avoids the explicit synchronous composition of subsystems and thereby the state explosion problem. Experimental results show that the method can be used to verify industrial applications of considerable complexity","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"17 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":"129427547","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":"Computationally efficient supervisor design: abstraction and modularity","authors":"Lei Feng, W. Wonham","doi":"10.1109/WODES.2006.1678399","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678399","url":null,"abstract":"A flexible modular and hierarchical structure is presented to reduce computational effort in designing optimal nonblocking supervisors for discrete-event systems (DES). The structure organizes the system into modular subsystems that embody internal interacting dependencies. Verification and coordination among modular subsystems are achieved through their model abstractions. Sufficient conditions are presented to guarantee that these coordinators and modular supervisors result in optimal nonblocking control. A medium-sized example demonstrates the computational advantage of our approach","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":"124230526","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":"Diagnosis of cyclic discrete-event systems using active acquisition of information","authors":"D. Thorsley, D. Teneketzis","doi":"10.1109/WODES.2006.1678438","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678438","url":null,"abstract":"This paper extends the active acquisition of information approach developed in Thorsley and Teneketzis (2004) from the case of acyclic, timed automata to the more general case of cyclic, asynchronous automata. Conditions for the existence of optimal solutions at finite cost are presented for both logical and stochastic systems. The information state method developed in the previous paper is reduced to a \"diagnoser state\" method wherein actions are computed for each potential set of states, as opposed to each potential set of strings. After developing a method of finding an optimal policy, a limited lookahead algorithm is presented to produce a suboptimal solution with less intensive computation","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":"134153076","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":"Reduction of the supervisor design problem with firing vector constraints","authors":"M. V. Iordache, P. Antsaklis","doi":"10.1109/WODES.2006.1678433","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678433","url":null,"abstract":"This paper presents a new result concerning the design of supervisors for specifications involving firing vectors. The result shows that without loss of permissiveness, a solution to the design problem can be found by solving another supervisor design problem, involving only marking specifications, in a transformed Petri net. On one hand, this result shows that the methods for marking specifications can be applied to specifications involving also firing vectors. On the other hand, the specifications involving firing vectors have been shown to be necessary in order to describe the P-type languages of free-labeled Petri nets. Since the method of this paper could be used without loss of permissiveness, it is complementary to our previous work on structural and suboptimal methods for the design of supervisors with firing vector specifications","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":"130702854","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":"LabVIEW State Diagram Toolkit for the Design and Implementation of Discrete-Event Systems","authors":"J. Falcon","doi":"10.1109/WODES.2006.382520","DOIUrl":"https://doi.org/10.1109/WODES.2006.382520","url":null,"abstract":"The LabVIEW state diagram toolkit can be used to design and implement state machines within the LabVIEW development environment. The toolkit includes a state diagram editor so the user can draw the logic that defines the state machine. As this visual representation of the logic is created, the state diagram editor generates the LabVIEW code that executes the state machine. The logic is represented in code by a series of graphical while loops and case statements. The generated LabVIEW code can run on multiple operating systems and multiple real-time targets including NI programmable automation controller (PAC) platforms such as PXI/cPCI, CompactRIO, and Compact FieldPoint","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"15 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":"115496818","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":"Scheduling of discrete event systems using mixed integer linear programming","authors":"A. Kobetski, Martin Fabian","doi":"10.1109/WODES.2006.1678411","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678411","url":null,"abstract":"To remain competitive, the modern industry strive for flexibility. Recently, a method for automatic generation of control code from a 3D simulation model of a flexible manufacturing system was developed. Finite automata and supervisory control theory (SCT) were used to guarantee the required behaviour of the system. This paper moves one step further. A method for automatic conversion between deterministic finite automata and mixed integer linear programming (MILP) formulation is presented. This allows to efficiently combine SCT and MILP to automatically generate time-optimal, collision-free and non-blocking working schedules","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":"114400541","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":"Programming discrete control systems using state machine templates","authors":"G. Ekberg, B. Krogh","doi":"10.1109/WODES.2006.1678430","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678430","url":null,"abstract":"This paper presents an approach to discrete control based on combining independent pre-defined control templates (simple state machines) to create the control software for an entire discrete process. Using this approach, application engineers who are typically not programmers can assign instances of the state-machine templates to each device in the process and identify the conditions that control the state transitions in each state machine. Experience with industrial customers shows there are several benefits realized from this methodology. The purpose of this paper is to introduce this practical methodology to the discrete-event systems research community, and to suggest several directions for research","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"137 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":"115127546","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":"Decidability, expressivity and state-space computation of stopwatch Petri nets with discrete-time semantics","authors":"M. Magnin, P. Molinaro, O. Roux","doi":"10.1109/WODES.2006.1678404","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678404","url":null,"abstract":"In this paper, we address the general class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Stopwatches can be reset, stopped and started. Our goal is to apply a discrete approach: we propose a structural translation from this model to classical Petri nets with flush arcs and inhibitor hyperarcs. Further on, we prove that this translation preserves weak timed bisimilarity. For the theory of Petri nets with stopwatches, the consequences are both theoretical and practical: 1) Petri nets with flush arcs and inhibitor hyperarcs, discrete-time TPNs and 1-safe discrete-time SwTPNs are equally expressive w.r.t. timed bisimilarity, thus timed language acceptance; 2) reachability problem - undecidable with dense-time semantics - becomes decidable once discrete-time is considered; 3) state space of discrete-time SwPNs can be computed directly by using existing tools for classical Petri nets; 4) we can verify temporal properties on a SwPN by working on the classical Petri net resulting from the translation. We give experimental results comparing the discrete-time state space computation and the dense-time one showing that, in many cases, combinatory explosion is not such a big concern. For the sake of simplicity, our results are explained on a model whose high-level functions make them very convenient to understand: time Petri nets with flush arcs and inhibitor hyperarcs (FIHTPNs). Our conclusions can however be easily extended to the general class of SwPNs","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"31 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":"124604253","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 and decentralized supervisory control of concurrent discrete event systems using reduced system models","authors":"K. Schmidt, H. Marchand, B. Gaudin","doi":"10.1109/WODES.2006.1678423","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678423","url":null,"abstract":"This paper investigates the supervisor synthesis for concurrent systems based on reduced system models with the intention of complexity reduction. It is assumed that the expected behavior (specification) is given on a subset of the system alphabet, and the system behavior is reduced to this alphabet. Supervisors are computed for each reduced subsystem employing the modular approach in Komenda et al. (2005) and the decentralized approach in Lee and Wong (2002). Depending on the chosen architecture, we provide sufficient conditions for the consistent implementation of the reduced supervisors for the original system","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":"125679221","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}