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

Reachability Problems最新文献

筛选
英文 中文
Constrained Dynamic Tree Networks 约束动态树网络
Reachability Problems Pub Date : 2018-09-24 DOI: 10.1007/978-3-030-00250-3_4
M. Hague, Vincent Penelle
{"title":"Constrained Dynamic Tree Networks","authors":"M. Hague, Vincent Penelle","doi":"10.1007/978-3-030-00250-3_4","DOIUrl":"https://doi.org/10.1007/978-3-030-00250-3_4","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122835592","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
The Satisfiability of Word Equations: Decidable and Undecidable Theories 词方程的可满足性:可判定与不可判定理论
Reachability Problems Pub Date : 2018-09-24 DOI: 10.1007/978-3-030-00250-3_2
Joel D. Day, Vijay Ganesh, Paul He, F. Manea, Dirk Nowotka
{"title":"The Satisfiability of Word Equations: Decidable and Undecidable Theories","authors":"Joel D. Day, Vijay Ganesh, Paul He, F. Manea, Dirk Nowotka","doi":"10.1007/978-3-030-00250-3_2","DOIUrl":"https://doi.org/10.1007/978-3-030-00250-3_2","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122357161","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}
引用次数: 32
Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta 基于多面体验证龙格-库塔的非线性ode可达性分析
Reachability Problems Pub Date : 2018-09-24 DOI: 10.1007/978-3-030-00250-3_1
Julien Alexandre Dit Sandretto, J. Wan
{"title":"Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta","authors":"Julien Alexandre Dit Sandretto, J. Wan","doi":"10.1007/978-3-030-00250-3_1","DOIUrl":"https://doi.org/10.1007/978-3-030-00250-3_1","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114156343","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
Qualitative Reachability for Open Interval Markov Chains 开区间马尔可夫链的定性可达性
Reachability Problems Pub Date : 2018-09-18 DOI: 10.1007/978-3-030-00250-3_11
J. Sproston
{"title":"Qualitative Reachability for Open Interval Markov Chains","authors":"J. Sproston","doi":"10.1007/978-3-030-00250-3_11","DOIUrl":"https://doi.org/10.1007/978-3-030-00250-3_11","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115772820","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
Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams 压缩字符串模式的某些查询回答:从流到超流
Reachability Problems Pub Date : 2018-07-20 DOI: 10.1007/978-3-030-00250-3_9
Iovka Boneva, Joachim Niehren, Momar Sakho
{"title":"Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams","authors":"Iovka Boneva, Joachim Niehren, Momar Sakho","doi":"10.1007/978-3-030-00250-3_9","DOIUrl":"https://doi.org/10.1007/978-3-030-00250-3_9","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115343156","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}
引用次数: 2
Distributed Control Synthesis Using Euler's Method 基于欧拉法的分布式控制综合
Reachability Problems Pub Date : 2017-09-07 DOI: 10.1007/978-3-319-67089-8_9
A. Coënt, Julien Alexandre Dit Sandretto, Alexandre Chapoutot, L. Fribourg, F. Vuyst, L. Chamoin
{"title":"Distributed Control Synthesis Using Euler's Method","authors":"A. Coënt, Julien Alexandre Dit Sandretto, Alexandre Chapoutot, L. Fribourg, F. Vuyst, L. Chamoin","doi":"10.1007/978-3-319-67089-8_9","DOIUrl":"https://doi.org/10.1007/978-3-319-67089-8_9","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129393308","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}
引用次数: 11
Copyful Streaming String Transducers Copyful流式字符串传感器
Reachability Problems Pub Date : 2017-09-07 DOI: 10.1007/978-3-319-67089-8_6
E. Filiot, P. Reynier
{"title":"Copyful Streaming String Transducers","authors":"E. Filiot, P. Reynier","doi":"10.1007/978-3-319-67089-8_6","DOIUrl":"https://doi.org/10.1007/978-3-319-67089-8_6","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129487230","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
Reachability Problem for Polynomial Iteration Is PSPACE-complete 多项式迭代的可达性问题是pspace完全的
Reachability Problems Pub Date : 2017-09-07 DOI: 10.1007/978-3-319-67089-8_10
R. Niskanen
{"title":"Reachability Problem for Polynomial Iteration Is PSPACE-complete","authors":"R. Niskanen","doi":"10.1007/978-3-319-67089-8_10","DOIUrl":"https://doi.org/10.1007/978-3-319-67089-8_10","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133789131","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
The Multiple Dimensions of Mean-Payoff Games - (Extended Abstract) 平均收益博弈的多维度(扩展摘要)
Reachability Problems Pub Date : 2017-09-07 DOI: 10.1007/978-3-319-67089-8_1
L. Doyen
{"title":"The Multiple Dimensions of Mean-Payoff Games - (Extended Abstract)","authors":"L. Doyen","doi":"10.1007/978-3-319-67089-8_1","DOIUrl":"https://doi.org/10.1007/978-3-319-67089-8_1","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115521923","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
Space-Efficient Fragments of Higher-Order Fixpoint Logic 高阶不动点逻辑的空间高效片段
Reachability Problems Pub Date : 2017-09-07 DOI: 10.1007/978-3-319-67089-8_3
Florian Bruse, M. Lange, É. Lozes
{"title":"Space-Efficient Fragments of Higher-Order Fixpoint Logic","authors":"Florian Bruse, M. Lange, É. Lozes","doi":"10.1007/978-3-319-67089-8_3","DOIUrl":"https://doi.org/10.1007/978-3-319-67089-8_3","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126525023","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
首页 上一页 下一页 尾页
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学术官方微信