发布求助
文献互助 智能选刊 最新文献

2006 8th International Workshop on Discrete Event Systems最新文献

筛选
英文 中文
An Optimization Approach for Identification of Petri Nets Petri网识别的一种优化方法
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382528
M. Dotoli, M. Fanti, A. M. Mangini
{"title":"An Optimization Approach for Identification of Petri Nets","authors":"M. Dotoli, M. Fanti, A. M. Mangini","doi":"10.1109/WODES.2006.382528","DOIUrl":"https://doi.org/10.1109/WODES.2006.382528","url":null,"abstract":"The paper addresses the identification problem of discrete event systems by determining the structure and the initial marking of a Petri net (PN) modeling the system. More precisely, we assume that the numbers of places and of transitions are given and that a finite sequence of transitions and the corresponding markings are completely or partially known. Hence, the conditions to univocally identify a pure PN are established. On the other hand, if the singleness of the identification problem solution can not be guaranteed, we introduce an approach based on the solution of an integer linear programming problem. The linear constraint definition utilizes the knowledge of the observed firing sequence and the properties imposed on the PN","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":"130617379","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}
引用次数: 17
Analysis of Reconfiguration Strategies Based On Petri Nets Models and Optimization Techniques 基于Petri网模型和优化技术的重构策略分析
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382526
T. Bourdeaud'huy, A. Toguyéni
{"title":"Analysis of Reconfiguration Strategies Based On Petri Nets Models and Optimization Techniques","authors":"T. Bourdeaud'huy, A. Toguyéni","doi":"10.1109/WODES.2006.382526","DOIUrl":"https://doi.org/10.1109/WODES.2006.382526","url":null,"abstract":"The concept of flexible manufacturing system (FMS) has been initially introduced to enable the production of different types of parts at the same time. But dependable requirements and especially the necessity to continue to produce in spite of the breakdown of a plant component lead to exploit the flexibility to reconfigure the plant. Nowadays, the challenge for researchers and industrials is thus to build reconfigurable manufacturing systems (RMS). A RMS must be able to adapt its configuration in real-time depending on production objectives and available resources. In this paper, we introduce the concept of reconfiguration process that defines the different steps to determine the actions needed to put the system in a state compatible with production resumption. Our approach expresses the reconfiguration process as a Petri net reachability problem instance. Our proposition consists in reusing the initial models developed for control purposes and to adapt them to model the potential reconfiguration actions (alternatives routes, start and stop of resources, feasible operating sequences). We define then a target marking - not necessarily entirely known - corresponding to the specification of a family of desired system states. Then we search for the firing sequences that bring the system from an initial marking to the desired objective marking. This problem is solved using mathematical programming techniques, allowing to optimize criteria corresponding to the relevance of the reconfiguration","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"33 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132496446","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}
引用次数: 5
Supervision patterns in discrete event systems diagnosis 离散事件系统诊断中的监督模式
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.1678440
Thierry Jéron, H. Marchand, S. Pinchinat, M. Cordier
{"title":"Supervision patterns in discrete event systems diagnosis","authors":"Thierry Jéron, H. Marchand, S. Pinchinat, M. Cordier","doi":"10.1109/WODES.2006.1678440","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678440","url":null,"abstract":"In this paper, we are interested in the diagnosis of discrete event systems modeled by finite transition systems. We propose a model of supervision patterns general enough to capture past occurrences of particular trajectories of the system. Modeling the diagnosis objective by a supervision pattern allows us to generalize the properties to be diagnosed and to render them independent of the description of the system. We first formally define the diagnosis problem in this context. We then derive techniques for the construction of a diagnoser and for the verification of the diagnosability based on standard operations on transition systems. We show that these techniques are general enough to express and solve in a unified way a broad class of diagnosis problems found in the literature, e.g. diagnosing permanent faults, multiple faults, fault sequences and some problems of intermittent faults","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"279 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":"133947102","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}
引用次数: 153
The Sigali Tool Box Environment Sigali工具箱环境
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382518
Loic Besnard, Hervé Marchand, Eric Rutten
{"title":"The Sigali Tool Box Environment","authors":"Loic Besnard, Hervé Marchand, Eric Rutten","doi":"10.1109/WODES.2006.382518","DOIUrl":"https://doi.org/10.1109/WODES.2006.382518","url":null,"abstract":"Sigali is a tool that offers functionalities for verification of reactive systems and discrete controller synthesis. It manipulates ILTS: Implicit Labeled Transition Systems, an equational and symbolic representation of automata. The techniques used consist in manipulating the system of equations modeling the system instead of the sets of solutions, thus avoiding the enumeration of the state space. Each set of states is uniquely characterized by a predicate and the operations on sets can be equivalently performed on the associated predicates. A wide variety of properties, such as invariance, reachability and attractivity can be checked or ensured. Many algorithms for computing state predicates are also available","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"20 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":"123126166","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}
引用次数: 15
Supremica - An integrated environment for verification, synthesis and simulation of discrete event systems 一个用于验证、综合和模拟离散事件系统的集成环境
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382401
K. Åkesson, Martin Fabian, H. Flordal, R. Malik
{"title":"Supremica - An integrated environment for verification, synthesis and simulation of discrete event systems","authors":"K. Åkesson, Martin Fabian, H. Flordal, R. Malik","doi":"10.1109/WODES.2006.382401","DOIUrl":"https://doi.org/10.1109/WODES.2006.382401","url":null,"abstract":"An integrated environment, Supremica, for verification, synthesis and simulation of discrete event systems is presented. The basic model in Supremica is finite automata where the transitions have an associated event together with a guard condition and an action function that updates automata variables. Supremica uses two main approaches to handle large state-spaces. The first approach exploits modularity in order to divide the original problem into many smaller problems that together solve the original problem. The second approach uses an efficient data structure, a binary decision diagram, to symbolically represent the reachable states. Models in Supremica may be simulated in the environment. It is also possible to generate code that implements the behavior of the model using both the IEC 61131 and the IEC 61499 standard","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":"123856535","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}
引用次数: 239
Prioritized Synchronization under Mask for Interaction/Control of Event-Driven Systems 面向事件驱动系统交互/控制的掩码下优先同步
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.1678402
Changyan Zhou, R. Kumar
{"title":"Prioritized Synchronization under Mask for Interaction/Control of Event-Driven Systems","authors":"Changyan Zhou, R. Kumar","doi":"10.1109/WODES.2006.1678402","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678402","url":null,"abstract":"The paper introduces a formalism for modeling interaction and control of partially observed discrete event systems, called prioritized synchronous composition under mask (PSC/M). PSC/M is able to capture several common modes of interactions such as strict/prioritized synchronization, interleaving, hiding and renaming. As a result PSC/M can serve as a single canonical model of interaction. PSC/M possesses the useful properties of commutativity and associativity. When PSC/M is employed as a control mechanism, it helps remove the control and the observation compatibility requirements of the control. We study the PSC/M-based control problem where both plant and supervisor have their own control and observation limitations. The existence condition is achievability, which is weaker than controllability and observability combined. (A weaker condition is required since we allow supervisors to be nondeterministic.) Both the existence and synthesis can be performed polynomially in the size of the plant and the specification. We show that in the setting of PSC/M the problem of control for a partial specification (one defined over a subset of events) can be transformed to the one of control for complete specification","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":"125090363","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
Fault Diagnosis for Time Petri Nets 时间Petri网故障诊断
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.1678448
G. Jiroveanu, R. Boel, B. de Schutter
{"title":"Fault Diagnosis for Time Petri Nets","authors":"G. Jiroveanu, R. Boel, B. de Schutter","doi":"10.1109/WODES.2006.1678448","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678448","url":null,"abstract":"This paper presents an on-line algorithm for fault diagnosis of time Petri net (TPN) models. The plant observation is given by a subset of transitions whose occurrence is always reported while the faults are represented by unobservable transitions. The model-based diagnosis uses the TPN model to derive the legal traces that obey the received observation and then checks whether fault events occurred or not. To avoid the consideration of all the interleavings of the unobservable concurrent transitions, the plant analysis is based on partial orders (unfoldings). The legal plant behavior is obtained as a set of configurations. The set of legal traces in the TPN is obtained solving a system of (max,+)-linear inequalities called the characteristic system of a configuration. We present two methods to derive the entire set of solutions of a characteristic system, one based on extended linear complementarity problem and the second one based on constraint propagation that exploits the partial order relation between the events in the configuration","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"74 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":"130925198","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}
引用次数: 16
Scheduling of flexible manufacturing systems using timed Petri nets and mathematical programming 基于定时Petri网和数学规划的柔性制造系统调度
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.1678414
T. Bourdeaud'huy, S. Hanafi, P. Yim
{"title":"Scheduling of flexible manufacturing systems using timed Petri nets and mathematical programming","authors":"T. Bourdeaud'huy, S. Hanafi, P. Yim","doi":"10.1109/WODES.2006.1678414","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678414","url":null,"abstract":"In this paper, we propose a mathematical programming model for the exact resolution of the reachability problem in timed Petri nets. Such nets allow to model a large class of scheduling problems, while taking into account concurrency, parallelism and synchronisation. They are thus a natural way of dealing with \"flexible\" manufacturing problems, where several resources can be used for the same task. Our model is as general as possible since we do not make assumptions about the firing policy","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"39 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":"125738807","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}
引用次数: 8
Marked-String Accepting Observers for the Hierarchical and Decentralized Control of Discrete Event Systems 离散事件系统层次与分散控制的标记字符串接受观测器
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382509
K. Schmidt, T. Moor
{"title":"Marked-String Accepting Observers for the Hierarchical and Decentralized Control of Discrete Event Systems","authors":"K. Schmidt, T. Moor","doi":"10.1109/WODES.2006.382509","DOIUrl":"https://doi.org/10.1109/WODES.2006.382509","url":null,"abstract":"The paper extends previous work, where we develop a control theory for nonblocking hierarchical control of decentralized discrete event systems (DES). The results are based on two technical conditions for the hierarchical abstraction: it has to be (i) locally nonblocking and (ii) marked string accepting. In this paper, we investigate the systematic construction of the hierarchical abstraction. Starting from an initial natural projection which need not fulfil (i) and (ii), we provide an algorithm to compute the hierarchical abstraction with the coarsest equivalence kernel finer than that of the initial natural projection, and such that (i) and (ii) hold. Our approach extends the work in (K. Wong and W.M. Wonham, 2004), where the authors compute observers for the hierarchical control of DES","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"39 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":"126762864","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}
引用次数: 13
Testing Modularity of Local Supervisors: An Approach Based on Abstractions 基于抽象的局部监控模块测试方法
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.1678416
P. Pena, J. Cury, S. Lafortune
{"title":"Testing Modularity of Local Supervisors: An Approach Based on Abstractions","authors":"P. Pena, J. Cury, S. Lafortune","doi":"10.1109/WODES.2006.1678416","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678416","url":null,"abstract":"This paper presents an efficient way to detect conflict in composed systems controlled by local supervisors designed using the supervisory control theory of discrete event systems. The idea is to apply the required modularity test not over the languages implemented by the supervisors, but over abstractions of the supervisors with some specific characteristics. The concept of observer and some constraints on the set of relevant events are the basis for the approach. An illustrative example is presented","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"2000 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":"132372613","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}
引用次数: 33
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信