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

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

筛选
英文 中文
Min-Max Model Predictive Control for Uncertain Max-Min-Plus-Scaling Systems 不确定max - min - plus尺度系统的Min-Max模型预测控制
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1080/00207170601094404
I. Necoara, B. Schutter, T. Boom, H. Hellendoorn
{"title":"Min-Max Model Predictive Control for Uncertain Max-Min-Plus-Scaling Systems","authors":"I. Necoara, B. Schutter, T. Boom, H. Hellendoorn","doi":"10.1080/00207170601094404","DOIUrl":"https://doi.org/10.1080/00207170601094404","url":null,"abstract":"We extend the model predictive control (MPC) framework that has been developed previously to a class of uncertain discrete event systems that can be modeled using the operations maximization, minimization, addition and scalar multiplication. This class encompasses max-plus-linear systems, min-max-plus systems, bilinear max-plus systems and polynomial max-plus systems. We first consider open-loop min-max MPC and we show that the resulting optimization problem can be transformed into a set of linear programming problems. Then, min-max feedback model predictive control using disturbance feedback policies is presented, which leads to improved performance compared to the open-loop approach","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":"115338974","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
Modular Supervisory Control of Discrete-Event Systems with Abstraction and Incremental Hierarchical Construction 抽象增量层次结构离散事件系统的模块化监督控制
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382507
R. Hill, D. Tilbury
{"title":"Modular Supervisory Control of Discrete-Event Systems with Abstraction and Incremental Hierarchical Construction","authors":"R. Hill, D. Tilbury","doi":"10.1109/WODES.2006.382507","DOIUrl":"https://doi.org/10.1109/WODES.2006.382507","url":null,"abstract":"This paper addresses the problem of state explosion by outlining a procedure for incrementally building modular supervisors that are nonconflicting by construction. Abstractions are employed to make the procedure more computationally feasible. Proof is given showing the set of modular supervisors generated in this manner meet given specifications without blocking. Furthermore, an example is provided that demonstrates the reduction in complexity that this approach provides","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"108 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":"115458564","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}
引用次数: 75
On performance monotonicity and basic servers semantics of continuous Petri nets 连续Petri网的性能单调性和基本服务器语义
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382530
C. Mahulea, L. Recalde, Manuel Silva
{"title":"On performance monotonicity and basic servers semantics of continuous Petri nets","authors":"C. Mahulea, L. Recalde, Manuel Silva","doi":"10.1109/WODES.2006.382530","DOIUrl":"https://doi.org/10.1109/WODES.2006.382530","url":null,"abstract":"Continuous Petri nets were introduced as an approximation to deal with the state explosion problem which can appear in discrete event models. When time is introduced, the flow through a fluidified transition can be defined in many ways. The most used in literature are infinite and finite servers semantics. Both can be seen as derived from stochastic Petri nets. The practical problems addressed in this contribution are: (1) a sufficient condition for the performance monotonicity, and (2) a study of the transition semantics, always related to continuous Petri nets. We prove that under some conditions, the subclass of mono-T-semiflow is monotone and also for the same class of nets we prove a property for which infinite servers semantics offers a better approximation than finite servers semantics for the discrete model","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"45 1-10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114048369","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}
引用次数: 27
Computationally Efficient Supervisor Design: Control Flow Decomposition 计算效率主管设计:控制流程分解
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.1678400
Lei Feng, W. Wonham
{"title":"Computationally Efficient Supervisor Design: Control Flow Decomposition","authors":"Lei Feng, W. Wonham","doi":"10.1109/WODES.2006.1678400","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678400","url":null,"abstract":"This paper presents structural criteria for qualitative reasoning and reduction in discrete event systems. On this basis, the computation of a control synthesis may be considerably simplified. Interconnections among plant components and specifications are captured by a new modeling tool, control-flow net. Special net structures that guarantee nonblocking control are identified","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"290 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":"115906283","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}
引用次数: 19
A Tool for Controller Synthesis via Symbolic Model Checking 一种基于符号模型检验的控制器综合工具
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382523
A. Gromyko, M. Pistore, P. Traverso
{"title":"A Tool for Controller Synthesis via Symbolic Model Checking","authors":"A. Gromyko, M. Pistore, P. Traverso","doi":"10.1109/WODES.2006.382523","DOIUrl":"https://doi.org/10.1109/WODES.2006.382523","url":null,"abstract":"We present a framework for the synthesis of controllers for (non-deterministic) discrete event systems with temporal logic specifications. A tool is built on top of symbolic model checking techniques and binary decision diagrams, with allows for dealing with problems of significant size. Besides, the framework allows for a (controlled) plant simulation and verification","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"51 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":"122646325","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
Efficient reachability analysis on modular discrete-event systems using binary decision diagrams 基于二元决策图的模块化离散事件系统的有效可达性分析
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.1678444
Martin Byröd, B. Lennartson, A. Vahidi, K. Åkesson
{"title":"Efficient reachability analysis on modular discrete-event systems using binary decision diagrams","authors":"Martin Byröd, B. Lennartson, A. Vahidi, K. Åkesson","doi":"10.1109/WODES.2006.1678444","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678444","url":null,"abstract":"A well known strategy for handling the exponential complexity of modular discrete event systems is to represent the state space symbolically, using binary decision diagrams (BBDs). In this paper, key success factors in the design of efficient BDD-based reachability algorithms for synthesis and verification are discussed. It is also shown how the modular structure of a discrete event system (DES) can be utilized by taking advantage of the process communication graph and partitioning techniques. A reachability algorithm based on these principles is discussed and a proof of correctness for the algorithm is given","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"63 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":"124801410","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
A Toolbox for the Development of Logic Controllers using Petri Nets 一个使用Petri网开发逻辑控制器的工具箱
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382522
Georg Frey, F. Wagner
{"title":"A Toolbox for the Development of Logic Controllers using Petri Nets","authors":"Georg Frey, F. Wagner","doi":"10.1109/WODES.2006.382522","DOIUrl":"https://doi.org/10.1109/WODES.2006.382522","url":null,"abstract":"This paper presents a toolbox for the development of control algorithms for programmable logic controllers based on Petri nets. The toolbox supports the complete development process including design, verification, validation, quality evaluation, simulation and PLC code generation","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":"125341945","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
Applying Structural Techniques for Efficient Analysis of Complex SWN Models 应用结构技术对复杂SWN模型进行有效分析
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382529
L. Capra
{"title":"Applying Structural Techniques for Efficient Analysis of Complex SWN Models","authors":"L. Capra","doi":"10.1109/WODES.2006.382529","DOIUrl":"https://doi.org/10.1109/WODES.2006.382529","url":null,"abstract":"Petri nets structural techniques may be used not only to study interesting system properties, but also to manage state space explosion and discrete-event simulation complexity. In order to avoid net unfolding, a symbolic calculus for high level PN structural analysis is needed, directly working on net annotations. Colored Petri nets structural analysis relies upon a common subset of functional operators. A language to denote structural relations in WN (a CPN flavor retaining expressive power) was introduced and proved to be closed under these operators. The paper shows an application of structural techniques for efficient performance-oriented analysis of a complex stochastic WN (SWN) model representing a P2P configuration management tool. Structural techniques are used in combination with symmetries specified through the WN formalism","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"18 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":"122345608","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}
引用次数: 0
Optimal node visitation in acyclic stochastic digraphs 无循环随机有向图的最优节点访问
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.382394
T. Bountourelis, S. Reveliotis
{"title":"Optimal node visitation in acyclic stochastic digraphs","authors":"T. Bountourelis, S. Reveliotis","doi":"10.1109/WODES.2006.382394","DOIUrl":"https://doi.org/10.1109/WODES.2006.382394","url":null,"abstract":"Given a stochastic, acyclic, connected digraph with a single source node and a control agent that repetitively traverses this graph, each time starting from the source node, we want to define a control policy that will enable this agent to visit each of the graph terminal nodes a prespecified number of times, while minimizing the expected number of the graph traversals. We first formulate this problem as a specially structured discrete time Markov decision process, and we subsequently develop an asymptotically optimal randomized policy of polynomial complexity with respect to the problem size","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"13 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133684723","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}
引用次数: 4
Efficient representation for formal verification of PLC programs 有效表示PLC程序的形式验证
2006 8th International Workshop on Discrete Event Systems Pub Date : 2006-07-10 DOI: 10.1109/WODES.2006.1678428
V. Gourcuff, O. D. Smet, Jean-Marc Faure
{"title":"Efficient representation for formal verification of PLC programs","authors":"V. Gourcuff, O. D. Smet, Jean-Marc Faure","doi":"10.1109/WODES.2006.1678428","DOIUrl":"https://doi.org/10.1109/WODES.2006.1678428","url":null,"abstract":"This paper addresses scalability of model-checking using the NuSMV model-checker. To avoid or at least limit combinatory explosion, an efficient representation of PLC programs is proposed. This representation includes only the states that are meaningful for properties proof. A method to translate PLC programs developed in structured text into NuSMV models based on this representation is described and exemplified on several examples. The results, state space size and verification time, obtained with models constructed using this method are compared to those obtained with previously published methods so as to assess efficiency of the proposed representation","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"42 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":"133987874","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}
引用次数: 67
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信