2008 9th International Workshop on Discrete Event Systems最新文献

Solving two supervisory control benchmark problems using Supremica

2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605934

S. Miremadi, K. Åkesson, Martin Fabian, A. Vahidi, B. Lennartson

{"title":"Solving two supervisory control benchmark problems using Supremica","authors":"S. Miremadi, K. Åkesson, Martin Fabian, A. Vahidi, B. Lennartson","doi":"10.1109/WODES.2008.4605934","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605934","url":null,"abstract":"Two supervisory control benchmark problems for WODESpsila08 are solved using the tool Supremica. Supremica is a tool for formal synthesis of discrete-event control functions based on discrete event models of the uncontrolled plant and specifications of the desired closed-loop behavior. By using formal synthesis of control functions the need for formal verification is reduced since the control functions are computed to automatically fulfill the given specifications, that is, they are ldquocorrect by constructionrdquo. The modeling framework in Supremica is based on finite automata. Supremica implements several techniques for being able to solve large scale problems. In this paper it is evaluated how the algorithms implemented in Supremica that are based on binary decision diagrams performs on the two benchmark problems. The two benchmark problems are generalization of two classical problems; cat and mouse, and the dining philosopherspsila problem. The benchmark problems are parameterized such that it is possible to create problem instances with huge state-spaces. The benchmark shows that supremica can efficiently solve rather large problem instances.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"36 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":"123145439","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}

引用次数: 32

Performance analysis of linear systems over semiring with additive inputs 具有加性输入的半环线性系统的性能分析

2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605920

L. Hardouin, Bertrand Cottenceau, S. Lagrange, Euriell Le Corronc

引用次数: 8

A fast approximation algorithm for the Lyapunov exponent of stochastic max-plus systems 随机max-plus系统Lyapunov指数的快速逼近算法

2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605921

R. Goverde, B. Heidergott, G. Merlet

引用次数: 4

Fault diagnosis in discrete event systems modeled by Petri nets with outputs 带输出Petri网建模的离散事件系统故障诊断

2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605987

Yu Ru, C. Hadjicostis

{"title":"Fault diagnosis in discrete event systems modeled by Petri nets with outputs","authors":"Yu Ru, C. Hadjicostis","doi":"10.1109/WODES.2008.4605987","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605987","url":null,"abstract":"In this paper, we study fault diagnosis in discrete event systems modeled by Petri nets with outputs, i.e., Petri nets with place sensors and transition sensors. Faults are modeled as unobservable transitions and are divided into different types. We assume that the Petri net model is accompanied by a description of the likelihood of each transition at any particular marking. Given a sequence of observations from place and transition sensors, our goal is to calculate the belief (namely, the degree of confidence) regarding the occurrence of faults belonging to each type. We first focus on the computation of beliefs in Petri nets with only transition sensors (i.e., labeled Petri nets) and we construct an online monitor that produces these beliefs by tracking the existence of faulty transitions in execution paths that match the sequence of labels observed so far. To handle place sensors, we transform a given Petri net with outputs into an equivalent labeled Petri net that translates the sensing information into a sequence of labels in the equivalent labeled Petri net. Using this transformation of Petri net and observation sequence, we can then compute the belief for each fault type in the same way as in labeled Petri nets.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"2 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":"114288221","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}

引用次数: 6

Supervisor synthesis based on abstractions of nondeterministic automata 基于不确定性自动机抽象的监督综合

2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605981

R. Su, J. van Schuppen, J. Rooda

引用次数: 9

Supervision of an industrial plant subject to a maximal duration constraint 对受最长期限限制的工业厂房的监督

2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605954

A. Atto, C. Martinez, S. Amari

引用次数: 6

New results on the nonconflict test of modular supervisors 模块化监督器非冲突测试的新结果

2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605991

Patrı́cia N. Pena, Antonio E. C. da Cunha, J. Cury, Stéphane Lafortune

引用次数: 11

Modeling systems biology from the point of view of discrete and hybrid systems 从离散和混合系统的角度对系统生物学进行建模

2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605956

M. Antoniotti

{"title":"Modeling systems biology from the point of view of discrete and hybrid systems","authors":"M. Antoniotti","doi":"10.1109/WODES.2008.4605956","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605956","url":null,"abstract":"The research areas at the intersection of biology, computer science, and applied mathematics are all well established at this point in time; they all comprise what is nowadays called systems biology [1], intended as the discipline interested in identifying emergent behavior from the complex interactions of various biological systems. Yet, these interdisciplinary areas seem still in need of absorbing and applying the deepest results and the most advanced techniques coming from their originating fields. In particular, the development of models of biological systems poses questions of scale that are nowadays at the frontier of our software and hardware computing capabilities. Such questions pertain both the representation issues and the pure computational issues. The representation issue arises when the discussion turns to the actual languages and formalisms (the ontologies, cfr. [2], [3]) used to describe and exchange biological models of the genome and of the proteome and their - often discrete - behavior. The computational issues arise when we are faced with the need to treat models of systems comprising a large number of variables, either for formal treatment via reachability analysis or for simulation speed to perform parameter space sweeps (e.g., see [4]). The proposed session gathers contributions that will extend our knowledge of these issues with the goal of advancing our understanding at the core of systems biology.","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":"121950083","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}

引用次数: 2

Stochastic optimization for control of maintenance systems 维修系统控制的随机优化

2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605928

T. Farenhorst-Yuan, B. Heidergott

引用次数: 0

Extraction and representation of a supervisor using guards in extended finite automata 扩展有限自动机中监督器的提取与表示

2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605944

S. Miremadi, K. Åkesson, B. Lennartson

{"title":"Extraction and representation of a supervisor using guards in extended finite automata","authors":"S. Miremadi, K. Åkesson, B. Lennartson","doi":"10.1109/WODES.2008.4605944","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605944","url":null,"abstract":"In supervisory control theory, an issue that often arises in real industrial applications is the huge number of states for the supervisor, which requires a lot of memory. Another problem that is typically encountered for the users of supervisory synthesis tools is lack of information and unreadability of the supervisor. In this paper, we introduce a method to characterize a controllable and non-blocking supervisor directly on the modular automata (sub-plants and sub-specifications), by extracting some guard conditions from the synthesized supervisor and the synchronized automaton. Thus, the presented approach may potentially model a complex supervisor using a compact representation whilst not infringe the original modular structure. Furthermore, the guard conditions, which are generated from a set of states, may give the user of the synthesis procedure a better understanding of which states that were removed during the synthesis. In order to obtain more compact guard expressions, we include some unnecessary states (unreachable and extended forbidden states) in the set of states that will be used for guard generation. By exploiting this extra information, it is possible to reduce the logical expressions to more compact guard conditions.","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":"129844544","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}

引用次数: 45