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

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

筛选
英文 中文
Supervisory control using satisfiability solvers 利用满足解算器进行监督控制
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605926
A. Voronov, K. Åkesson
{"title":"Supervisory control using satisfiability solvers","authors":"A. Voronov, K. Åkesson","doi":"10.1109/WODES.2008.4605926","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605926","url":null,"abstract":"This paper discusses how satisfiability solvers may be used to verify and synthesize discrete event supervisors as defined in the supervisory control theory. By using the supervisory control theory it is possible to generate control functions that are correct by construction. However, the computations for verification and synthesis of the supervisors are NP-complete and in order to make the method applicable for industrial use it is necessary to use algorithms and tools that could solve problems of industrial size. Within the model checking community satisfiability solvers have become an important tool for verification of large hardware circuits. In this paper it is shown how to formulate some problems in the supervisory control theory as Boolean satisfiability problems. Formulations of satisfiability problems for synthesizing a path to a marked state, verification of controllability and verification of deadlock presence are presented. The method is evaluated on some examples of high complexity.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"29 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":"121036007","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
Performance analysis of χ models using discrete-time probabilistic reward graphs 使用离散时间概率奖励图的χ模型性能分析
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605931
N. Trcka, S. Georgievska, J. Markovski, S. Andova, E. de Vink
{"title":"Performance analysis of χ models using discrete-time probabilistic reward graphs","authors":"N. Trcka, S. Georgievska, J. Markovski, S. Andova, E. de Vink","doi":"10.1109/WODES.2008.4605931","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605931","url":null,"abstract":"We propose the model of discrete-time probabilistic reward graphs (DTPRGs) for performance analysis of systems exhibiting discrete deterministic time delays and probabilistic behavior, via their interpretation as discrete-time Markov reward chains, full-fledged platform for qualitative and quantitative analysis of timed systems based on the modeling language chi. The extension proposed in this paper is based on timed branching bisimulation reduction followed by a tailored inclusion of probabilities and rewards. The approach is applied in an industrial case study of a turntable drill. The resulting performance measures are shown to be comparable to those obtained by existent methods of the chi environment, viz. simulation and continuous-time Markovian analysis.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"189 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":"123211305","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
Synthesis of controllers using symbolic reachability graphs 使用符号可达图的控制器综合
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605965
C. A. Abid, Belhassen Zouari
{"title":"Synthesis of controllers using symbolic reachability graphs","authors":"C. A. Abid, Belhassen Zouari","doi":"10.1109/WODES.2008.4605965","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605965","url":null,"abstract":"This paper deals with the control problem of forbidden states in discrete event systems. The plant model is described by a coloured Petri net and its evolving by an optimized state graph, called symbolic reachability graph. The problem is studied in the general framework of Ramadge and Wonham theory considering uncontrollable transitions and under nonblockingness requirement. The synthesis method computes a maximally permissive coloured Petri net controller. First, the symbolic reachability graph is considered to determine the legal behaviour that the plant model should have. Then, the theory of regions is applied in order to generate a maximally permissive controller. This controller is expressed in coloured Petri net terms and, is connected to the plant model. The proposed approach exploits the benefits of the parameterized modeling power of coloured Petri nets as well as the reduced size of the symbolic reachability graph.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"38 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":"122999792","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
Classification of keystroke dynamics - a case study of fuzzified discrete event handling 击键动力学的分类——模糊离散事件处理的一个案例研究
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605978
Gernot Herbst, S. Bocklisch
{"title":"Classification of keystroke dynamics - a case study of fuzzified discrete event handling","authors":"Gernot Herbst, S. Bocklisch","doi":"10.1109/WODES.2008.4605978","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605978","url":null,"abstract":"The expressiveness of discrete events can be enhanced by incorporating additional attributes, which can be employed for a more detailed classification of an event or to formulate certain requirements towards future instantiations of an event in greater depth. This work is dedicated especially to attributes gained from potentially unreliable sources, such as virtually all sensor systems are. The two main aspects to be discussed are modelling of vague attributes on the one hand, and suitable methods of formulating requirements along with appropriate measures of fulfilment on the other hand. As one practical example, a biometrically enhanced password authentication procedure will be presented. It is meant to serve both as a case study and motivation for the approach pursued subsequently in this work.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"4 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":"117141258","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
Model checking embedded and real time systems 模型检查嵌入式和实时系统
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605955
K. Larsen
{"title":"Model checking embedded and real time systems","authors":"K. Larsen","doi":"10.1109/WODES.2008.4605955","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605955","url":null,"abstract":"Given that the 2007 Turing Award was recently given to Ed Clarke, Alan Emerson and Joseph Sifakis for their ground-breaking work on model checking the talk will present two model checking tools, UPPAAL and visualSTATE. The ldquosecretsrdquo behind their success will be revealed, UPPAAL being the most efficient tool for verifying timed systems, and visualSTATE allowing for verification of 10500 states using a patented method we have developed. Also, current research on applying and specializing UPPAAL to controller synthesis will be addressed.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"51 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":"131499357","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
Fault model identification with Petri nets 基于Petri网的故障模型识别
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605989
M. P. Cabasino, A. Giua, C. Hadjicostis, C. Seatzu
{"title":"Fault model identification with Petri nets","authors":"M. P. Cabasino, A. Giua, C. Hadjicostis, C. Seatzu","doi":"10.1109/WODES.2008.4605989","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605989","url":null,"abstract":"Most of the fault identification problems in the discrete event systems literature assume knowledge of the structure of the net system, including the nature (and behavior) of the possible faults. In this paper we deal with this problem within the framework of Petri nets by removing the requirement that the nature (and behavior) of the fault is known. In particular, we devise a way to identify the structure of the faulty transitions of the system given its language. Then, we generalize this procedure to unobservable faults, in which case the structure of the faulty system needs to be recognized from the knowledge of the structure of the fault-free system, and the projection of the faulty system language on the set of non-faulty events, that are assumed to be observable.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"162 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":"127360494","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
An improvement of policy gradient estimation algorithms 策略梯度估计算法的改进
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605940
Yanjie Li, Fang Cao, Xi-Ren Cao
{"title":"An improvement of policy gradient estimation algorithms","authors":"Yanjie Li, Fang Cao, Xi-Ren Cao","doi":"10.1109/WODES.2008.4605940","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605940","url":null,"abstract":"In this paper, we discuss the problem of the sample-path-based (on-line) performance gradient estimation for Markov systems. The existing on-line performance gradient estimation algorithms generally require a standard importance sampling assumption. When the assumption does not hold, these algorithms may lead to poor estimates for the gradients. We show that this assumption can be relaxed. We propose a few algorithms that provide performance gradient estimates for systems that do not satisfy the assumption. Simulation examples are given to illustrate the accuracy of the estimates.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"30 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":"124845261","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}
引用次数: 3
Practical applications of Boolean Satisfiability 布尔可满足性的实际应用
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605925
Joao Marques-Silva
{"title":"Practical applications of Boolean Satisfiability","authors":"Joao Marques-Silva","doi":"10.1109/WODES.2008.4605925","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605925","url":null,"abstract":"Boolean satisfiability (SAT) solvers have been the subject of remarkable improvements since the mid 90s. One of the main reasons for these improvements has been the wide range of practical applications of SAT. Indeed, examples of modern applications of SAT range from termination analysis in term-rewrite systems to circuit-level prediction of crosstalk noise. The success of SAT solvers motivated many practical applications, but many practical applications have also provided the examples and the challenges that allowed the development of more efficient SAT solvers. This paper provides an overview of some of the most well-known applications of SAT and outlines several other successful applications of SAT. Moreover, the improvements in SAT solvers motivated the development of new algorithms for strategic extensions of SAT. As a result, the paper also provides a brief survey of recent work on extensions of SAT, including pseudo-Boolean constraints, maximum satisfiability, model counting and quantified Boolean formulas.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"51 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":"123312187","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}
引用次数: 136
Dioid of formal power series for the determination of performance parameters of communication networks 通信网络性能参数测定的形式幂级数法
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605953
Mabia Daniel-Cavalcante, R. Santos-Mendes
{"title":"Dioid of formal power series for the determination of performance parameters of communication networks","authors":"Mabia Daniel-Cavalcante, R. Santos-Mendes","doi":"10.1109/WODES.2008.4605953","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605953","url":null,"abstract":"Discrete event dynamic systems (DEDS) are systems whose state transitions are triggered by events that occur at discrete instants. The communication networks are examples of this kind of systems. The mathematical constraints of some DEDS can be described more adequately using the dioid algebra. Previous works show that the problem of determining performance bounds for communication networks is simplified if modeled using this algebra. The compilation of existing rules and results on this field is called network calculus (NC). The goal of this article is to propose a dioid of formal power series for the treatment of NC problems. To illustrate the adequacy of the proposed dioid, we analyze a FIFO multiplexer. The results obtained for this particular system represent an extension of previous results.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"13 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":"129759987","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}
引用次数: 3
Generalised eigenproblem in max-algebra 极大代数中的广义特征问题
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605951
R. Cuninghame-Green, P. Butkovic
{"title":"Generalised eigenproblem in max-algebra","authors":"R. Cuninghame-Green, P. Butkovic","doi":"10.1109/WODES.2008.4605951","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605951","url":null,"abstract":"In this paper we consider the generalized eigenproblem in max-algebra, i.e., given matrices A, B, find x and lambda such that A otimes x = lambda otimes B otimes x. We present several conditions that are necessary or sufficient for the existence of a solution to this problem.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"246 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":"116386085","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}
引用次数: 23
首页 上一页 下一页 尾页
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学术官方微信