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

Principles of Systems Design最新文献

筛选
英文 中文
Symbolic Verification and Strategy Synthesis for Turn-based Stochastic Games 基于回合制随机对策的符号验证与策略综合
Principles of Systems Design Pub Date : 2022-11-11 DOI: 10.48550/arXiv.2211.06141
M. Kwiatkowska, G. Norman, David Parker, Gabriel Santos
{"title":"Symbolic Verification and Strategy Synthesis for Turn-based Stochastic Games","authors":"M. Kwiatkowska, G. Norman, David Parker, Gabriel Santos","doi":"10.48550/arXiv.2211.06141","DOIUrl":"https://doi.org/10.48550/arXiv.2211.06141","url":null,"abstract":"Stochastic games are a convenient formalism for modelling systems that comprise rational agents competing or collaborating within uncertain environments. Probabilistic model checking techniques for this class of models allow us to formally specify quantitative specifications of either collective or individual behaviour and then automatically synthesise strategies for the agents under which these specifications are guaranteed to be satisfied. Although good progress has been made on algorithms and tool support, efficiency and scalability remain a challenge. In this paper, we investigate a symbolic implementation based on multi-terminal binary decision diagrams. We describe how to build and verify turn-based stochastic games against either zero-sum or Nash equilibrium based temporal logic specifications. We collate a set of benchmarks for this class of games, and evaluate the performance of our approach, showing that it is superior in a number of cases and that strategies synthesised in a symbolic fashion can be considerably more compact.","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129561495","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
Correct-by-Construction Runtime Enforcement in AI - A Survey 人工智能中构造正确的运行时执行——一个调查
Principles of Systems Design Pub Date : 2022-08-30 DOI: 10.48550/arXiv.2208.14426
Bettina Könighofer, Roderick Bloem, Rüdiger Ehlers, Christian Pek
{"title":"Correct-by-Construction Runtime Enforcement in AI - A Survey","authors":"Bettina Könighofer, Roderick Bloem, Rüdiger Ehlers, Christian Pek","doi":"10.48550/arXiv.2208.14426","DOIUrl":"https://doi.org/10.48550/arXiv.2208.14426","url":null,"abstract":"Runtime enforcement refers to the theories, techniques, and tools for enforcing correct behavior with respect to a formal specification of systems at runtime. In this paper, we are interested in techniques for constructing runtime enforcers for the concrete application domain of enforcing safety in AI. We discuss how safety is traditionally handled in the field of AI and how more formal guarantees on the safety of a self-learning agent can be given by integrating a runtime enforcer. We survey a selection of work on such enforcers, where we distinguish between approaches for discrete and continuous action spaces. The purpose of this paper is to foster a better understanding of advantages and limitations of different enforcement techniques, focusing on the specific challenges that arise due to their application in AI. Finally, we present some open challenges and avenues for future work.","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134138625","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
On Specifications and Proofs of Timed Circuits 关于定时电路的规范和证明
Principles of Systems Design Pub Date : 2022-08-17 DOI: 10.48550/arXiv.2208.08147
Matthias Függer, C. Lenzen, U. Schmid
{"title":"On Specifications and Proofs of Timed Circuits","authors":"Matthias Függer, C. Lenzen, U. Schmid","doi":"10.48550/arXiv.2208.08147","DOIUrl":"https://doi.org/10.48550/arXiv.2208.08147","url":null,"abstract":"Given a discrete-state continuous-time reactive system, like a digital circuit, the classical approach is to first model it as a state transition system and then prove its properties. Our contribution advocates a different approach: to directly operate on the input-output behavior of such systems, without identifying states and their transitions in the first place. We discuss the benefits of this approach at hand of some examples, which demonstrate that it nicely integrates with concepts of self-stabilization and fault-tolerance. We also elaborate on some unexpected artefacts of module composition in our framework, and conclude with some open research questions.","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124810974","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
Parameter Synthesis in Markov Models: A Gentle Survey 马尔可夫模型的参数综合研究
Principles of Systems Design Pub Date : 2022-07-14 DOI: 10.48550/arXiv.2207.06801
N. Jansen, Sebastian Junges, J. Katoen
{"title":"Parameter Synthesis in Markov Models: A Gentle Survey","authors":"N. Jansen, Sebastian Junges, J. Katoen","doi":"10.48550/arXiv.2207.06801","DOIUrl":"https://doi.org/10.48550/arXiv.2207.06801","url":null,"abstract":"This paper surveys the analysis of parametric Markov models whose transitions are labelled with functions over a finite set of parameters. These models are symbolic representations of uncountable many concrete probabilistic models, each obtained by instantiating the parameters. We consider various analysis problems for a given logical specification $varphi$: do all parameter instantiations within a given region of parameter values satisfy $varphi$?, which instantiations satisfy $varphi$ and which ones do not?, and how can all such instantiations be characterised, either exactly or approximately? We address theoretical complexity results and describe the main ideas underlying state-of-the-art algorithms that established an impressive leap over the last decade enabling the fully automated analysis of models with millions of states and thousands of parameters.","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128516948","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 Survey on Satisfiability Checking for the μ-Calculus through Tree Automata 用树自动机检验μ微积分可满足性的研究
Principles of Systems Design Pub Date : 2022-07-01 DOI: 10.48550/arXiv.2207.00517
D. Hausmann, Nir Piterman
{"title":"A Survey on Satisfiability Checking for the μ-Calculus through Tree Automata","authors":"D. Hausmann, Nir Piterman","doi":"10.48550/arXiv.2207.00517","DOIUrl":"https://doi.org/10.48550/arXiv.2207.00517","url":null,"abstract":". Algorithms for model checking and satisfiability of the modal µ -calculus start by converting formulas to alternating parity tree automata. Thus, model checking is reduced to checking acceptance by tree automata and satisfiability to checking their emptiness. The first reduces directly to the solution of parity games but the second is more compli-cated.Wereview the non-emptiness checking of alternating tree automata by a reduction to solving parity games of a certain structure, so-called emptiness games . Since the emptiness problem for alternating tree automata is ExpTime -complete, the size of these games is exponential in the number of states of the input automaton. We show how the construction of the emptiness games combines a (fixed) structural part with (history-)determinization of parity word automata. For tree automata with certain syntactic structures, simpler methods may be used to handle the treatment of the word automata, which then may be asymptotically smaller than in the general case. These results have direct consequences in satisfiability and validity checking for (various fragments of) the modal µ -calculus.","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122199876","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
What's Decidable about Discrete Linear Dynamical Systems? 离散线性动力系统有什么可判定的?
Principles of Systems Design Pub Date : 2022-06-22 DOI: 10.48550/arXiv.2206.11412
T. Karimov, Edon Kelmendi, J. Ouaknine, J. Worrell
{"title":"What's Decidable about Discrete Linear Dynamical Systems?","authors":"T. Karimov, Edon Kelmendi, J. Ouaknine, J. Worrell","doi":"10.48550/arXiv.2206.11412","DOIUrl":"https://doi.org/10.48550/arXiv.2206.11412","url":null,"abstract":". We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, focussing in particular on reachability, model-checking, and invariant-generation questions, both unconditionally as well as relative to oracles for the Skolem Problem.","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"44 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113938630","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
A Framework for Transforming Specifications in Reinforcement Learning 强化学习中规范转换的框架
Principles of Systems Design Pub Date : 2021-10-30 DOI: 10.1007/978-3-031-22337-2_29
R. Alur, Suguman Bansal, O. Bastani, Kishor Jothimurugan
{"title":"A Framework for Transforming Specifications in Reinforcement Learning","authors":"R. Alur, Suguman Bansal, O. Bastani, Kishor Jothimurugan","doi":"10.1007/978-3-031-22337-2_29","DOIUrl":"https://doi.org/10.1007/978-3-031-22337-2_29","url":null,"abstract":"","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127204043","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}
引用次数: 15
Variance Reduction in Stochastic Reaction Networks using Control Variates 使用控制变量的随机反应网络的方差缩减
Principles of Systems Design Pub Date : 2021-10-18 DOI: 10.1007/978-3-031-22337-2_22
Michael Backenköhler, L. Bortolussi, V. Wolf
{"title":"Variance Reduction in Stochastic Reaction Networks using Control Variates","authors":"Michael Backenköhler, L. Bortolussi, V. Wolf","doi":"10.1007/978-3-031-22337-2_22","DOIUrl":"https://doi.org/10.1007/978-3-031-22337-2_22","url":null,"abstract":"","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116995627","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
Specification and Validation of Autonomous Driving Systems: A Multilevel Semantic Framework 自动驾驶系统的规范和验证:一个多层语义框架
Principles of Systems Design Pub Date : 2021-09-14 DOI: 10.1007/978-3-031-22337-2_5
M. Bozga, J. Sifakis
{"title":"Specification and Validation of Autonomous Driving Systems: A Multilevel Semantic Framework","authors":"M. Bozga, J. Sifakis","doi":"10.1007/978-3-031-22337-2_5","DOIUrl":"https://doi.org/10.1007/978-3-031-22337-2_5","url":null,"abstract":"","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134157416","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
Universal Algorithms for Parity Games and Nested Fixpoints 奇偶博弈和嵌套固定点的通用算法
Principles of Systems Design Pub Date : 2020-01-13 DOI: 10.1007/978-3-031-22337-2_12
Marcin Jurdzi'nski, Rémi Morvan, K. S. Thejaswini
{"title":"Universal Algorithms for Parity Games and Nested Fixpoints","authors":"Marcin Jurdzi'nski, Rémi Morvan, K. S. Thejaswini","doi":"10.1007/978-3-031-22337-2_12","DOIUrl":"https://doi.org/10.1007/978-3-031-22337-2_12","url":null,"abstract":"","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121624990","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
下一页 尾页
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学术官方微信