Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)最新文献

筛选
英文 中文
Session details: Compositional Methods 会话详细信息:组合方法
Jyotirmoy V. Deshmukh
{"title":"Session details: Compositional Methods","authors":"Jyotirmoy V. Deshmukh","doi":"10.1145/3258028","DOIUrl":"https://doi.org/10.1145/3258028","url":null,"abstract":"","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122217827","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
Session details: Data-driven Design 会话细节:数据驱动设计
Ashutosh Trivedi
{"title":"Session details: Data-driven Design","authors":"Ashutosh Trivedi","doi":"10.1145/3258029","DOIUrl":"https://doi.org/10.1145/3258029","url":null,"abstract":"","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128367631","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
Session details: Algorithms and Foundations 会议细节:算法和基础
Sicun Gao
{"title":"Session details: Algorithms and Foundations","authors":"Sicun Gao","doi":"10.1145/3258031","DOIUrl":"https://doi.org/10.1145/3258031","url":null,"abstract":"","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131763616","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
Global Almost-Sure Reachability in Stochastic Constant-Rate Multi-Mode Systems 随机恒速率多模系统的全局几乎确定可达性
F. Somenzi, B. Touri, Ashutosh Trivedi
{"title":"Global Almost-Sure Reachability in Stochastic Constant-Rate Multi-Mode Systems","authors":"F. Somenzi, B. Touri, Ashutosh Trivedi","doi":"10.1145/3178126.3178149","DOIUrl":"https://doi.org/10.1145/3178126.3178149","url":null,"abstract":"A constant-rate multi-mode system is a hybrid system that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent constant rates. We introduce and study a stochastic extension of a constant-rate multi-mode system where the dynamics is specified by mode-dependent compactly supported probability distributions over a set of constant rate vectors. The almost-sure reachability problem for stochastic multi-mode systems is to decide whether for all ε > 0 and for all pairs of start and target states in a path-connected and bounded safety set there exists a control strategy that almost-surely steers the system from the start state to the ε-neighborhood of the target state without leaving the safety set. We prove a necessary and sufficient condition to decide almost-sure reachability and, using this condition, we show that almost-sure reachability can be decided in polynomial time. Our algorithm can be used as a path-following algorithm in combination with off-the-shelf path-planning algorithms to make a robot with noisy low-level controllers follow a path with arbitrary precision.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132336481","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}
引用次数: 1
Clock Allocation in Timed Automata and Graph Colouring 时间自动机中的时钟分配与图形着色
N. Saeedloei, Feliks Kluzniak
{"title":"Clock Allocation in Timed Automata and Graph Colouring","authors":"N. Saeedloei, Feliks Kluzniak","doi":"10.1145/3178126.3178138","DOIUrl":"https://doi.org/10.1145/3178126.3178138","url":null,"abstract":"We consider the problem of optimal clock allocation for a fairly general class of timed automata, TAS, under the safe assumption that all locations are reachable. Techniques similar to those used in compiler technology allow us to construct an interference graph: the problem of clock allocation for timed automata in TAS can be reduced to that of colouring this graph. We then describe a class of timed automata, TADS ⊊ TAS, for which optimal clock allocation can be computed in polynomial time, because the corresponding interference graphs are perfect. Finally, we discuss some of the difficulties in applying similar techniques to timed automata outside TAS.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122690117","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
Accurate reachability analysis of uncertain nonlinear systems 不确定非线性系统的精确可达性分析
M. Rungger, Majid Zamani
{"title":"Accurate reachability analysis of uncertain nonlinear systems","authors":"M. Rungger, Majid Zamani","doi":"10.1145/3178126.3178127","DOIUrl":"https://doi.org/10.1145/3178126.3178127","url":null,"abstract":"We propose an algorithm to over-approximate the reachable set of nonlinear systems with bounded, time-varying parameters and uncertain initial conditions. The algorithm is based on the conservative representation of the nonlinear dynamics by a differential inclusion consisting of a linear term and the Minkowsky sum of two convex sets. The linear term and one of the two sets are obtained by a conservative first-order over-approximation of the nonlinear dynamics with respect to the system state. The second set accounts for the effect of the time-varying parameters. A distinctive feature of the novel algorithm is the possibility to over-approximate the reachable set to any desired accuracy by appropriately choosing the parameters in the computation. We provide an example that illustrates the effectiveness of our approach.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126384251","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}
引用次数: 20
Parameter Invariant Monitoring for Signal Temporal Logic 信号时序逻辑的参数不变性监测
Nima Roohi, R. Kaur, James Weimer, O. Sokolsky, Insup Lee
{"title":"Parameter Invariant Monitoring for Signal Temporal Logic","authors":"Nima Roohi, R. Kaur, James Weimer, O. Sokolsky, Insup Lee","doi":"10.1145/3178126.3178140","DOIUrl":"https://doi.org/10.1145/3178126.3178140","url":null,"abstract":"Signal Temporal Logic (STL) is a prominent specification formalism for real-time systems, and monitoring these specifications, specially when (for different reasons such as learning) behavior of systems can change over time, is quite important. There are three main challenges in this area: (1) full observation of system state is not possible due to noise or nuisance parameters, (2) the whole execution is not available during the monitoring, and (3) computational complexity of monitoring continuous time signals is very high. Although, each of these challenges has been addressed by different works, to the best of our knowledge, no one has addressed them all together. In this paper, we show how to extend any parameter invariant test procedure for single points in time to a parameter invariant test procedure for efficiently monitoring continuous time executions of a system against STL properties. We also show, how to extend probabilistic error guarantee of the input test procedure to a probabilistic error guarantee for the constructed test procedure.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122164651","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}
引用次数: 9
Stabilizing switched nonlinear systems under restricted switching 受限开关非线性系统的稳定
A. Kundu
{"title":"Stabilizing switched nonlinear systems under restricted switching","authors":"A. Kundu","doi":"10.1145/3178126.3178130","DOIUrl":"https://doi.org/10.1145/3178126.3178130","url":null,"abstract":"This paper deals with input/output-to-state stability (IOSS) of continuous-time switched nonlinear systems under restricted switching. The switching signals obey restrictions on: (i) transitions between subsystems, and (ii) dwell time on subsystems. Given a family of systems, possibly containing non-IOSS dynamics, we present an algorithm to construct a time-dependent switching signal that guarantees IOSS of the resulting switched system under these restrictions. The main apparatus for our analysis are multiple Lyapunov-like functions and graph-theoretic tools.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"1 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131574999","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
Averist: Algorithmic Verifier for Stability of Linear Hybrid Systems 线性混合系统稳定性的Averist算法验证
Miriam García Soto, P. Prabhakar
{"title":"Averist: Algorithmic Verifier for Stability of Linear Hybrid Systems","authors":"Miriam García Soto, P. Prabhakar","doi":"10.1145/3178126.3178154","DOIUrl":"https://doi.org/10.1145/3178126.3178154","url":null,"abstract":"In this paper, we explain the architecture and implementation of the tool Averist that performs stability verification for linear hybrid systems. This tool implements a hybridization method for approximating linear hybrid systems by hybrid systems with polyhedral inclusion dynamics. It also implements a new counterexample guided abstraction refinement framework for analyzing the hybrid systems with polyhedral inclusion dynamics that are generated as a result of the hybridization. Some of the main features of our tool are as follows: (1) our tool is based on algorithmic techniques that do not rely on the computation of Lyapunov functions, (2) it returns a counterexample when it fails to establish stability, (3) it is less prone to numerical instability issues as compared to Lyapunov function based tools.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116800953","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
A New Perspective on Quality Evaluation for Control Systems with Stochastic Timing 随机定时控制系统质量评价的新视角
M. Gaukler, Andreas Michalka, Peter Ulbrich, Tobias Klaus
{"title":"A New Perspective on Quality Evaluation for Control Systems with Stochastic Timing","authors":"M. Gaukler, Andreas Michalka, Peter Ulbrich, Tobias Klaus","doi":"10.1145/3178126.3178134","DOIUrl":"https://doi.org/10.1145/3178126.3178134","url":null,"abstract":"As control applications are particularly sensitive to timing variations, the Quality of Control (QoC) is degraded by varying execution conditions of the underlying real-time system. In particular, transitions between different execution or environmental conditions pose a significant issue as they may impact the QoC unexpectedly. So far, the QoC is usually evaluated either in a stationary, time-invariant way, which cannot analyze said transitions, or by simulation, which becomes inefficient when confronted with random influencing factors. In this paper, we propose a new perspective on QoC evaluation for modern, adaptive real-time systems with varying timing conditions. For this, we present a time-variant stochastic assessment approach that incorporates the effects mentioned before. Our results demonstrate that adaptive scheduling and runtime behavior considerably impacts the QoC. At the same time, the proposed scheme significantly outperforms a traditional simulation.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122267086","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学术文献互助群
群 号:481959085
Book学术官方微信