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

Reachability Problems最新文献

筛选
英文 中文
Complexity Bounds for Ordinal-Based Termination - (Invited Talk) 基于序的终止的复杂度界限-(特邀演讲)
Reachability Problems Pub Date : 2014-07-22 DOI: 10.1007/978-3-319-11439-2_1
S. Schmitz
{"title":"Complexity Bounds for Ordinal-Based Termination - (Invited Talk)","authors":"S. Schmitz","doi":"10.1007/978-3-319-11439-2_1","DOIUrl":"https://doi.org/10.1007/978-3-319-11439-2_1","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131296629","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}
引用次数: 10
Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations 具有全邻域操作的图变换系统的参数化验证
Reachability Problems Pub Date : 2014-07-16 DOI: 10.1007/978-3-319-11439-2_6
G. Delzanno, Jan Stückrath
{"title":"Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations","authors":"G. Delzanno, Jan Stückrath","doi":"10.1007/978-3-319-11439-2_6","DOIUrl":"https://doi.org/10.1007/978-3-319-11439-2_6","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127656362","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
Reachability in Succinct One-Counter Games 简洁单counter游戏的可达性
Reachability Problems Pub Date : 2014-07-08 DOI: 10.1007/978-3-319-24537-9_5
P. Hunter
{"title":"Reachability in Succinct One-Counter Games","authors":"P. Hunter","doi":"10.1007/978-3-319-24537-9_5","DOIUrl":"https://doi.org/10.1007/978-3-319-24537-9_5","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115237265","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
Integer Vector Addition Systems with States 带状态的整数向量加法系统
Reachability Problems Pub Date : 2014-06-10 DOI: 10.1007/978-3-319-11439-2_9
C. Haase, Simon Halfon
{"title":"Integer Vector Addition Systems with States","authors":"C. Haase, Simon Halfon","doi":"10.1007/978-3-319-11439-2_9","DOIUrl":"https://doi.org/10.1007/978-3-319-11439-2_9","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"15 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116203958","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}
引用次数: 55
Parameterized Verification of Broadcast Networks of Register Automata 寄存器自动机广播网络的参数化验证
Reachability Problems Pub Date : 2013-09-24 DOI: 10.1007/978-3-642-41036-9_11
G. Delzanno, Arnaud Sangnier, Riccardo Traverso
{"title":"Parameterized Verification of Broadcast Networks of Register Automata","authors":"G. Delzanno, Arnaud Sangnier, Riccardo Traverso","doi":"10.1007/978-3-642-41036-9_11","DOIUrl":"https://doi.org/10.1007/978-3-642-41036-9_11","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128415748","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}
引用次数: 25
Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games 并发可达性博弈及其他随机博弈的单项策略
Reachability Problems Pub Date : 2013-09-24 DOI: 10.1007/978-3-642-41036-9_12
S. Frederiksen, Peter Bro Miltersen
{"title":"Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games","authors":"S. Frederiksen, Peter Bro Miltersen","doi":"10.1007/978-3-642-41036-9_12","DOIUrl":"https://doi.org/10.1007/978-3-642-41036-9_12","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129232993","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
Automated Verification of Concurrent Software 并发软件的自动验证
Reachability Problems Pub Date : 2013-09-24 DOI: 10.1007/978-3-642-41036-9_2
D. Kroening
{"title":"Automated Verification of Concurrent Software","authors":"D. Kroening","doi":"10.1007/978-3-642-41036-9_2","DOIUrl":"https://doi.org/10.1007/978-3-642-41036-9_2","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125554293","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
Formal Languages, Word Problems of Groups and Decidability 形式语言，群的词问题和可决性
Reachability Problems Pub Date : 2013-09-24 DOI: 10.1007/978-3-642-41036-9_14
Sam A. M. Jones, R. Thomas
{"title":"Formal Languages, Word Problems of Groups and Decidability","authors":"Sam A. M. Jones, R. Thomas","doi":"10.1007/978-3-642-41036-9_14","DOIUrl":"https://doi.org/10.1007/978-3-642-41036-9_14","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121879043","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
MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters MaRDiGraS:在大型集群上简化可达性图的构建
Reachability Problems Pub Date : 2013-09-24 DOI: 10.1007/978-3-642-41036-9_9
C. Bellettini, Matteo Camilli, L. Capra, Mattia Monga
{"title":"MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters","authors":"C. Bellettini, Matteo Camilli, L. Capra, Mattia Monga","doi":"10.1007/978-3-642-41036-9_9","DOIUrl":"https://doi.org/10.1007/978-3-642-41036-9_9","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"161 46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127753943","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
Parametric Interrupt Timed Automata 参数中断定时自动机
Reachability Problems Pub Date : 2013-09-24 DOI: 10.1007/978-3-642-41036-9_7
B. Bérard, S. Haddad, Aleksandra Jovanovic, D. Lime
{"title":"Parametric Interrupt Timed Automata","authors":"B. Bérard, S. Haddad, Aleksandra Jovanovic, D. Lime","doi":"10.1007/978-3-642-41036-9_7","DOIUrl":"https://doi.org/10.1007/978-3-642-41036-9_7","url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133412244","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}
引用次数: 10
首页 上一页 下一页 尾页
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学术官方微信