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

Reachability Problems最新文献

筛选
英文 中文
Rearranging Two Dimensional Arrays by Prefix Reversals 通过前缀反转重新排列二维数组
Reachability Problems Pub Date : 2015-09-21 DOI: 10.1007/978-3-319-24537-9_14
A. Yamamura
{"title":"Rearranging Two Dimensional Arrays by Prefix Reversals","authors":"A. Yamamura","doi":"10.1007/978-3-319-24537-9_14","DOIUrl":"https://doi.org/10.1007/978-3-319-24537-9_14","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123038788","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
Synthesis Problems for One-Counter Automata 单计数器自动机的综合问题
Reachability Problems Pub Date : 2015-09-21 DOI: 10.1007/978-3-319-24537-9_9
A. Lechner
{"title":"Synthesis Problems for One-Counter Automata","authors":"A. Lechner","doi":"10.1007/978-3-319-24537-9_9","DOIUrl":"https://doi.org/10.1007/978-3-319-24537-9_9","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123024266","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
Over-Approximating Terms Reachable by Context-Sensitive Rewriting 过度逼近上下文敏感重写可达的术语
Reachability Problems Pub Date : 2015-09-21 DOI: 10.1007/978-3-319-24537-9_12
Nirina Andrianarivelo, P. Réty
{"title":"Over-Approximating Terms Reachable by Context-Sensitive Rewriting","authors":"Nirina Andrianarivelo, P. Réty","doi":"10.1007/978-3-319-24537-9_12","DOIUrl":"https://doi.org/10.1007/978-3-319-24537-9_12","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128498740","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
Reasoning About Cost-Utility Constraints in Probabilistic Models 概率模型中成本效用约束的推理
Reachability Problems Pub Date : 2015-09-21 DOI: 10.1007/978-3-319-24537-9_1
C. Baier
{"title":"Reasoning About Cost-Utility Constraints in Probabilistic Models","authors":"C. Baier","doi":"10.1007/978-3-319-24537-9_1","DOIUrl":"https://doi.org/10.1007/978-3-319-24537-9_1","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127020094","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
Multithreaded-Cartesian Abstract Interpretation of Multithreaded Recursive Programs Is Polynomial 多线程递归程序的多线程笛卡尔抽象解释是多项式
Reachability Problems Pub Date : 2015-09-21 DOI: 10.1007/978-3-319-24537-9_11
A. Malkis
{"title":"Multithreaded-Cartesian Abstract Interpretation of Multithreaded Recursive Programs Is Polynomial","authors":"A. Malkis","doi":"10.1007/978-3-319-24537-9_11","DOIUrl":"https://doi.org/10.1007/978-3-319-24537-9_11","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125556277","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
Integer-Complete Synthesis for Bounded Parametric Timed Automata 有界参数时间自动机的整数完全综合
Reachability Problems Pub Date : 2015-09-21 DOI: 10.1007/978-3-319-24537-9_2
É. André, D. Lime, O. Roux
{"title":"Integer-Complete Synthesis for Bounded Parametric Timed Automata","authors":"É. André, D. Lime, O. Roux","doi":"10.1007/978-3-319-24537-9_2","DOIUrl":"https://doi.org/10.1007/978-3-319-24537-9_2","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131236853","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}
引用次数: 14
Reducing Bounded Realizability Analysis to Reachability Checking 将有界可实现性分析简化为可达性检查
Reachability Problems Pub Date : 2015-09-21 DOI: 10.1007/978-3-319-24537-9_13
Masaya Shimakawa, Shigeki Hagihara, N. Yonezaki
{"title":"Reducing Bounded Realizability Analysis to Reachability Checking","authors":"Masaya Shimakawa, Shigeki Hagihara, N. Yonezaki","doi":"10.1007/978-3-319-24537-9_13","DOIUrl":"https://doi.org/10.1007/978-3-319-24537-9_13","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124569593","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
A Topological Method for Finding Invariant Sets of Continuous Systems 寻找连续系统不变集的拓扑方法
Reachability Problems Pub Date : 2015-09-21 DOI: 10.1007/978-3-319-24537-9_7
L. Fribourg, É. Goubault, Sameh Mohamed, M. Mrozek, S. Putot
{"title":"A Topological Method for Finding Invariant Sets of Continuous Systems","authors":"L. Fribourg, É. Goubault, Sameh Mohamed, M. Mrozek, S. Putot","doi":"10.1007/978-3-319-24537-9_7","DOIUrl":"https://doi.org/10.1007/978-3-319-24537-9_7","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133206237","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
Reachability in MDPs: Refining Convergence of Value Iteration mdp中的可达性:优化值迭代的收敛性
Reachability Problems Pub Date : 2014-09-22 DOI: 10.1007/978-3-319-11439-2_10
S. Haddad, B. Monmege
{"title":"Reachability in MDPs: Refining Convergence of Value Iteration","authors":"S. Haddad, B. Monmege","doi":"10.1007/978-3-319-11439-2_10","DOIUrl":"https://doi.org/10.1007/978-3-319-11439-2_10","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122441593","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}
引用次数: 46
Parameterized Verification of Communicating Automata under Context Bounds 上下文边界下通信自动机的参数化验证
Reachability Problems Pub Date : 2014-09-22 DOI: 10.1007/978-3-319-11439-2_4
B. Bollig, P. Gastin, Jana Schubert
{"title":"Parameterized Verification of Communicating Automata under Context Bounds","authors":"B. Bollig, P. Gastin, Jana Schubert","doi":"10.1007/978-3-319-11439-2_4","DOIUrl":"https://doi.org/10.1007/978-3-319-11439-2_4","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121512054","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
首页 上一页 下一页 尾页
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学术官方微信