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

筛选
英文 中文
On control and cyber-physical systems: Challenges and opportunities for discrete event and hybrid systems 控制与网络物理系统:离散事件与混合系统的挑战与机遇
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605913
P. Antsaklis
{"title":"On control and cyber-physical systems: Challenges and opportunities for discrete event and hybrid systems","authors":"P. Antsaklis","doi":"10.1109/WODES.2008.4605913","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605913","url":null,"abstract":"Summary form only given. Networked digital devices interacting with physical and engineered systems are becoming ubiquitous and will be more so in the future. A deep understanding of the interactions between the cyber and physical worlds is essential in being able to build robust and safe systems, and this issue is receiving increased attention in the US by the networking and information technology community. Stronger cross-fertilization of ideas between control systems, networking and computer science is needed in both research and education to build these systems. In this talk, the main issues in cyber-physical systems will be discussed first in detail. A brief overview of a supervisory control approach in discrete event systems using Petri nets will be given with connections to computer science problems and a promising approach to design cyber-physical systems using passivity that include human interaction will be outlined.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"11 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":"128123018","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
Safety and transition-structure preserving abstraction of hybrid systems with inputs/outputs 具有输入/输出的混合系统的安全和过渡结构保持抽象
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605946
R. Kumar, C. Zhou, S. Jiang
{"title":"Safety and transition-structure preserving abstraction of hybrid systems with inputs/outputs","authors":"R. Kumar, C. Zhou, S. Jiang","doi":"10.1109/WODES.2008.4605946","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605946","url":null,"abstract":"We present a method for obtaining a discrete abstraction of a hybrid system modeled as an input-output hybrid automaton (I/O-HA), generalizing our earlier work on linear hybrid automaton with no inputs or outputs. The discrete abstraction we present preserves the discrete behaviors (the set of state trajectories sampled at instances immediately after the discrete transitions) of an I/O-HA, and thus it is adequate for safety verification. (The violation of a safety property can be formulated as the reachability of certain discrete states.) We represent the discrete behaviors of an I/O-HA as the discrete behaviors of an input-output transition system (I/O-TS), which possesses no continuous dynamics, i.e., it is a purely discrete system. A feature of our discrete abstraction of an I/O-HA into an I/O-TS is that it preserves the transition structure of the discrete dynamics, making it unique compared to the prior works on discrete abstraction of a hybrid system (which either did not preserve the discrete behaviors or the transition structure of the discrete dynamics). The discrete abstraction can be used for further analysis (such as verification, testing, control, diagnosis, monitoring, etc.) involving safety properties. The abstraction is illustrated through an adaptive cruise control example.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"11 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":"125493120","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
The Use of language projection for compositional verification of discrete event systems 语言投影在离散事件系统组合验证中的应用
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605966
S. Ware, R. Malik
{"title":"The Use of language projection for compositional verification of discrete event systems","authors":"S. Ware, R. Malik","doi":"10.1109/WODES.2008.4605966","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605966","url":null,"abstract":"This paper proposes the use of abstraction by language projection to improve the performance of compositional verification to prove or disprove that a large system of composed finite-state machines satisfies a given safety property. Algorithms are presented for the automatic verification of language inclusion and controllability for discrete event systems, and are applied to a set realistic industrial examples. The experimental results suggest that the method can improve performance considerably, particularly in cases where previous methods of compositional verification fail because a large number of automata need to be considered.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"7 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":"117326732","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
Asynchronous implementation of synchronous discrete event control 异步实现同步离散事件控制
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605942
S. Xu, R. Kumar
{"title":"Asynchronous implementation of synchronous discrete event control","authors":"S. Xu, R. Kumar","doi":"10.1109/WODES.2008.4605942","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605942","url":null,"abstract":"Discrete event control is typically designed under the synchronous hypothesis that sensing and actuation incur zero delays, i.e., there exists zero delay between an event execution at a plant site and its observation at a controller site, and also between a control computation at a controller site and its enforcement at a plant site. An actual implementation, however, is asynchronous, introducing delays in sensing as well as actuation. A natural question that arises is what additional property must a given specification satisfy so that it remains implementable in spite of the delays introduced by an underlying asynchronous implementation platform. We formulate the problem of asynchronous implementation of synchronous control when both the sensing and actuation delays are bounded. We introduce the notion of bounded-delay asynchronous composition to characterize the behavior of a controlled plant when the sensing and actuation delays are bounded. We introduce the notion of bounded-delay implementability and show that this together with the existence conditions of the synchronous setting (namely controllability, closure, and nonemptiness) serves as a necessary and sufficient condition for the existence of a controller so that the controlled behavior under the asynchronous implementation remains the same as that under the synchronous implementation. We present an algorithm for checking the property of bounded-delay implementability, whose complexity is linear (resp., quadratic) in the size of the plant (resp., specification), and exponential in the delay bounds. We also examine the lattice structure of a set of bounded-delay implementable languages, and show its non-closure under union whereas closure under union over an increasing chain and intersection.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"49 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":"133071243","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}
引用次数: 18
The application of supervisory control to deadlock avoidance in concurrent software 监控在并发软件死锁避免中的应用
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605961
Yin Wang, T. Kelly, M. Kudlur, S. Mahlke, S. Lafortune
{"title":"The application of supervisory control to deadlock avoidance in concurrent software","authors":"Yin Wang, T. Kelly, M. Kudlur, S. Mahlke, S. Lafortune","doi":"10.1109/WODES.2008.4605961","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605961","url":null,"abstract":"Ensuring deadlock-free execution of concurrent programs is a notoriously difficult problem, but an increasingly important one as multicore processors compel performance-conscious software developers to parallelize applications. We propose and validate a novel methodology for dynamically controlling the execution of concurrent software in order to provably avoid deadlocks. The methodology is based on supervisory control of discrete event systems modeled by Petri nets. Specifically, we synthesize feedback controllers for concurrent programs based on the theory of supervision based on place invariants and implement the controllers online to guarantee deadlock avoidance. We describe a full implementation of this methodology and report initial experimental results demonstrating its effectiveness and scalability.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"R-28 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":"126627475","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
Verification of initial-state opacity in security applications of DES DES安全应用中初始状态不透明性的验证
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605967
A. Saboori, C. Hadjicostis
{"title":"Verification of initial-state opacity in security applications of DES","authors":"A. Saboori, C. Hadjicostis","doi":"10.1109/WODES.2008.4605967","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605967","url":null,"abstract":"Motivated by security applications where the initial state of a system needs to be kept secret (opaque) to outside observers (intruders), we formulate, analyze and verify the notion of initial-state opacity in discrete event systems. Specifically, a system is initial-state opaque if the membership of its true initial state to a set of secret states remains opaque to an intruder who is modeled as an observer of the system activity through some projection map. In other words, based on observations through this map, the observer is never certain that the initial state of the system is within the set of secret states. To verify initial-state opacity, we address the initial-state estimation problem in discrete event systems via the construction of an initial-state estimator. This estimator captures estimates of the initial state of the system which are consistent with all observations obtained so far. We also analyze the properties and complexity of the initial-state estimator.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"109 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":"116455154","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}
引用次数: 78
Beyond Boolean SAT: Satisfiability modulo theories 超越布尔SAT:可满足模理论
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605924
A. Cimatti
{"title":"Beyond Boolean SAT: Satisfiability modulo theories","authors":"A. Cimatti","doi":"10.1109/WODES.2008.4605924","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605924","url":null,"abstract":"Many systems can be naturally represented in some decidable fragments of first order logic. The expressive power provided by a background theory allows to describe important aspects such as real time, continuous dynamics, and data flow over integer variables. The corresponding verification problems can be tackled by means of Satisfiability Modulo Theory (SMT) solvers. SMT solvers are based on the tight integration of propositional SAT solvers with dedicated procedures to reason about the theory component. In this paper, we overview the techniques underlying SMT, we show how to represent dynamic systems in fragments of first order logic, and discuss the application of SMT solvers to their verification.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"157 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":"114999503","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
Covering-based supervisory control of partially observed discrete event systems for state avoidance 部分观测离散事件系统状态回避的基于覆盖的监督控制
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605914
R. Hill, D. Tilbury, S. Lafortune
{"title":"Covering-based supervisory control of partially observed discrete event systems for state avoidance","authors":"R. Hill, D. Tilbury, S. Lafortune","doi":"10.1109/WODES.2008.4605914","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605914","url":null,"abstract":"In this work we present a new polynomial complexity approach to state avoidance for nondeterministic and partially observed discrete event systems. Our approach generates control based on a covering of the system state space that identifies overlapping sets of indistinguishable states. This approach is shown to be more permissive than existing state-feedback control techniques.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"25 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":"121635231","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}
引用次数: 7
On-line identification of Petri Nets with unobservable transitions 不可观测过渡Petri网的在线辨识
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605988
M. Dotoli, M. Fanti, A. M. Mangini, W. Ukovich
{"title":"On-line identification of Petri Nets with unobservable transitions","authors":"M. Dotoli, M. Fanti, A. M. Mangini, W. Ukovich","doi":"10.1109/WODES.2008.4605988","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605988","url":null,"abstract":"The paper addresses the problem of the on-line identification of Petri nets (PNs) modeling discrete event systems (DESs) that exhibit unobservable events. The identifier monitors the DES events and the corresponding available place markings. Assuming that the observable transition set, the place set and the corresponding PN structure are known, at each event occurrence an identification algorithm defines and solves some integer linear programming problems. We prove that the complete PN system describing both the observable and unobservable DES behavior is recursively identified. An example shows an application of the proposed technique.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"20 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":"117002028","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
Online diagnosis of discrete event systems based on Petri nets 基于Petri网的离散事件系统在线诊断
2008 9th International Workshop on Discrete Event Systems Pub Date : 2008-05-28 DOI: 10.1109/WODES.2008.4605986
F. Basile, P. Chiacchio, G. De Tommasi
{"title":"Online diagnosis of discrete event systems based on Petri nets","authors":"F. Basile, P. Chiacchio, G. De Tommasi","doi":"10.1109/WODES.2008.4605986","DOIUrl":"https://doi.org/10.1109/WODES.2008.4605986","url":null,"abstract":"A novel approach to fault diagnosis of discrete event systems is presented in this paper. The standard approach is based on the offline computation of the set of fault events that may have occurred at each reachable state, providing a fast online diagnosis at a price of excessive memory requirements. A different approach is here adopted, which is based on the online computation of the set of possible fault events required to explain the last observed event. This is efficiently achieved by using Petri nets, since their mathematical representation allows to formulate the fault diagnosis problems in terms of mathematical programming, which is a standard tool.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"86 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":"125652242","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}
引用次数: 7
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学术官方微信