Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control最新文献

筛选
英文 中文
ProbReach: verified probabilistic delta-reachability for stochastic hybrid systems ProbReach:随机混合系统的可达性验证
F. Shmarov, P. Zuliani
{"title":"ProbReach: verified probabilistic delta-reachability for stochastic hybrid systems","authors":"F. Shmarov, P. Zuliani","doi":"10.1145/2728606.2728625","DOIUrl":"https://doi.org/10.1145/2728606.2728625","url":null,"abstract":"We present ProbReach, a tool for verifying probabilistic reachability for stochastic hybrid systems, i.e., computing the probability that the system reaches an unsafe region of the state space. In particular, ProbReach will compute an arbitrarily small interval which is guaranteed to contain the required probability. Standard (non-probabilistic) reachability is undecidable even for linear hybrid systems. In ProbReach we adopt the weaker notion of delta-reachability, in which the unsafe region is overapproximated by a user-defined parameter (delta). This choice leads to false alarms, but also makes the reachability problem decidable for virtually any hybrid system. In ProbReach we have implemented a probabilistic version of delta-reachability that is suited for hybrid systems whose stochastic behaviour is given in terms of random initial conditions. In this paper we introduce the capabilities of ProbReach, give an overview of the parallel implementation, and present results for several benchmarks involving highly non-linear hybrid systems.","PeriodicalId":377654,"journal":{"name":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116725458","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}
引用次数: 58
Towards personalized prostate cancer therapy using delta-reachability analysis 利用delta可及性分析实现个性化前列腺癌治疗
Bing Liu, Soonho Kong, Sicun Gao, P. Zuliani, E. Clarke
{"title":"Towards personalized prostate cancer therapy using delta-reachability analysis","authors":"Bing Liu, Soonho Kong, Sicun Gao, P. Zuliani, E. Clarke","doi":"10.1145/2728606.2728634","DOIUrl":"https://doi.org/10.1145/2728606.2728634","url":null,"abstract":"Recent clinical studies suggest that the efficacy of hormone therapy for prostate cancer depends on the characteristics of individual patients. In this paper, we develop a computational framework for identifying patient-specific androgen ablation therapy schedules for postponing the potential cancer relapse. We model the population dynamics of heterogeneous prostate cancer cells in response to androgen suppression as a nonlinear hybrid automaton. We estimate personalized kinetic parameters to characterize patients and employ δ-reachability analysis to predict patient-specific therapeutic strategies. The results show that our methods are promising and may lead to a prognostic tool for prostate cancer therapy.","PeriodicalId":377654,"journal":{"name":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121995981","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
Reach-avoid problems with time-varying dynamics, targets and constraints 触及-避免具有时变动力学、目标和约束的问题
J. Fisac, Mo Chen, C. Tomlin, S. Sastry
{"title":"Reach-avoid problems with time-varying dynamics, targets and constraints","authors":"J. Fisac, Mo Chen, C. Tomlin, S. Sastry","doi":"10.1145/2728606.2728612","DOIUrl":"https://doi.org/10.1145/2728606.2728612","url":null,"abstract":"We consider a reach-avoid differential game, in which one of the players aims to steer the system into a target set without violating a set of state constraints, while the other player tries to prevent the first from succeeding; the system dynamics, target set, and state constraints may all be time-varying. The analysis of this problem plays an important role in collision avoidance, motion planning and aircraft control, among other applications. Previous methods for computing the guaranteed winning initial conditions and strategies for each player have either required augmenting the state vector to include time, or have been limited to problems with either no state constraints or entirely static targets, constraints and dynamics. To incorporate time-varying dynamics, targets and constraints without the need for state augmentation, we propose a modified Hamilton-Jacobi-Isaacs equation in the form of a double-obstacle variational inequality, and prove that the zero sublevel set of its viscosity solution characterizes the capture basin for the target under the state constraints. Through this formulation, our method can compute the capture basin and winning strategies for time-varying games at virtually no additional computational cost relative to the time-invariant case. We provide an implementation of this method based on well-known numerical schemes and show its convergence through a simple example; we include a second example in which our method substantially outperforms the state augmentation approach.","PeriodicalId":377654,"journal":{"name":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123572032","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}
引用次数: 200
Computing the Skorokhod distance between polygonal traces 计算多边形轨迹之间的Skorokhod距离
R. Majumdar, Vinayak S. Prabhu
{"title":"Computing the Skorokhod distance between polygonal traces","authors":"R. Majumdar, Vinayak S. Prabhu","doi":"10.1145/2728606.2728618","DOIUrl":"https://doi.org/10.1145/2728606.2728618","url":null,"abstract":"The Skorokhod distance is a natural metric on traces of continuous and hybrid systems. It measures the best match between two traces, each mapping a time interval [0, T] to a metric space O, when continuous bijective timing distortions are allowed. Formally, it computes the infimum, over all timing distortions, of the maximum of two components: the first component quantifies the timing discrepancy of the timing distortion, and the second quantifies the mismatch (in the metric space O) of the values after the timing distortion. Skorokhod distances appear in various fundamental hybrid systems analysis concerns: from definitions of hybrid systems semantics and notions of equivalence, to practical problems such as checking the closeness of models or the quality of simulations. Despite its extensive use in semantics, the computation problem for the Skorokhod distance between two finite sampled-time hybrid traces remained open. We address the problem of computing the Skorokhod distance between two polygonal traces (these traces arise when sampled-time traces are completed by linear interpolation between sample points). We provide an algorithm to compute the exact Skorokhod distance when trace values are compared using the L1, L2, and L∞ norms in n dimensions. Our algorithm, based on a reduction to Fréchet distances, is fully polynomial-time, and incorporates novel polynomial-time procedures for a set of geometric primitives in IRn over the three norms.","PeriodicalId":377654,"journal":{"name":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132543842","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}
引用次数: 21
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games 随机线性系统的时间逻辑控制
María Svorenová, Jan Křetínský, Martin Chmelík, K. Chatterjee, I. Cerná, C. Belta
{"title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","authors":"María Svorenová, Jan Křetínský, Martin Chmelík, K. Chatterjee, I. Cerná, C. Belta","doi":"10.1145/2728606.2728608","DOIUrl":"https://doi.org/10.1145/2728606.2728608","url":null,"abstract":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. We demonstrate our approach on an illustrative case study.","PeriodicalId":377654,"journal":{"name":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114265717","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}
引用次数: 34
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学术官方微信