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

Infinity最新文献

筛选
英文 中文
The bounded retransmission protocol revisited 重新访问了有界重传协议
Infinity Pub Date : 1997-01-01 DOI: 10.1016/S1571-0661(05)80425-6
D. Dams, R. Gerth
{"title":"The bounded retransmission protocol revisited","authors":"D. Dams, R. Gerth","doi":"10.1016/S1571-0661(05)80425-6","DOIUrl":"https://doi.org/10.1016/S1571-0661(05)80425-6","url":null,"abstract":"","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"146 1","pages":"26"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77266872","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
Abstraction of parameterized networks 参数化网络的抽象
Infinity Pub Date : 1997-01-01 DOI: 10.1016/S1571-0661(05)80429-3
D. Lesens, Hassen Saïdi
{"title":"Abstraction of parameterized networks","authors":"D. Lesens, Hassen Saïdi","doi":"10.1016/S1571-0661(05)80429-3","DOIUrl":"https://doi.org/10.1016/S1571-0661(05)80429-3","url":null,"abstract":"","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"399 1","pages":"42"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84843818","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}
引用次数: 19
Model checking rationally restricted right closures of recognizable graphs 模型检验合理地限制了可识别图的右闭包
Infinity Pub Date : 1997-01-01 DOI: 10.1016/S1571-0661(05)80424-4
Olaf Burkart
{"title":"Model checking rationally restricted right closures of recognizable graphs","authors":"Olaf Burkart","doi":"10.1016/S1571-0661(05)80424-4","DOIUrl":"https://doi.org/10.1016/S1571-0661(05)80424-4","url":null,"abstract":"","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"28 47","pages":"25"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1571-0661(05)80424-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72496193","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}
引用次数: 13
Bisimilarity of processes with finite-state systems 有限状态系统过程的双相似性
Infinity Pub Date : 1997-01-01 DOI: 10.1016/S1571-0661(05)80428-1
P. Jančar, A. Kucera
{"title":"Bisimilarity of processes with finite-state systems","authors":"P. Jančar, A. Kucera","doi":"10.1016/S1571-0661(05)80428-1","DOIUrl":"https://doi.org/10.1016/S1571-0661(05)80428-1","url":null,"abstract":"","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"8 1","pages":"41"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83387108","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}
引用次数: 9
Reachability sets of parameterized rings as regular languages 作为规则语言的参数化环的可达性集
Infinity Pub Date : 1997-01-01 DOI: 10.1016/S1571-0661(05)80427-X
L. Fribourg, Hans Olsén
{"title":"Reachability sets of parameterized rings as regular languages","authors":"L. Fribourg, Hans Olsén","doi":"10.1016/S1571-0661(05)80427-X","DOIUrl":"https://doi.org/10.1016/S1571-0661(05)80427-X","url":null,"abstract":"","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"441 1","pages":"40"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76541486","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}
引用次数: 42
Decidability of strong bisimulation of basic parallel processes using Hilbert's basis theorem 基于Hilbert基定理的基本并行过程强双模拟的可判定性
Infinity Pub Date : 1997-01-01 DOI: 10.1016/S1571-0661(05)80431-1
Jitka Stríbrná
{"title":"Decidability of strong bisimulation of basic parallel processes using Hilbert's basis theorem","authors":"Jitka Stríbrná","doi":"10.1016/S1571-0661(05)80431-1","DOIUrl":"https://doi.org/10.1016/S1571-0661(05)80431-1","url":null,"abstract":"","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"40 1","pages":"44"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81942594","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
Verifying invariants by approximate image computation 通过近似图像计算验证不变量
Infinity Pub Date : 1997-01-01 DOI: 10.1016/S1571-0661(05)82559-9
F. Balarin
{"title":"Verifying invariants by approximate image computation","authors":"F. Balarin","doi":"10.1016/S1571-0661(05)82559-9","DOIUrl":"https://doi.org/10.1016/S1571-0661(05)82559-9","url":null,"abstract":"","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"12 1","pages":"2-14"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84070482","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
L(a) = L(b)? L(a) = L(b)?
Infinity Pub Date : 1997-01-01 DOI: 10.1016/S1571-0661(05)80430-X
Géraud Sénizergues
{"title":"L(a) = L(b)?","authors":"Géraud Sénizergues","doi":"10.1016/S1571-0661(05)80430-X","DOIUrl":"https://doi.org/10.1016/S1571-0661(05)80430-X","url":null,"abstract":"","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"95 1","pages":"43"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86489418","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
A direct symbolic approach to model checking pushdown systems 一种直接的符号方法来建模检查下推系统
Infinity Pub Date : 1997-01-01 DOI: 10.1016/S1571-0661(05)80426-8
A. Finkel, Bernard Willems, P. Wolper
{"title":"A direct symbolic approach to model checking pushdown systems","authors":"A. Finkel, Bernard Willems, P. Wolper","doi":"10.1016/S1571-0661(05)80426-8","DOIUrl":"https://doi.org/10.1016/S1571-0661(05)80426-8","url":null,"abstract":"","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"304 1","pages":"27-37"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79807145","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}
引用次数: 226
Cyclic Petri net reachability sets are semi-linear effectively constructible 循环Petri网可达集是半线性有效可构造的
Infinity Pub Date : 1997-01-01 DOI: 10.1016/S1571-0661(05)80423-2
Zakaria Bouziane, A. Finkel
{"title":"Cyclic Petri net reachability sets are semi-linear effectively constructible","authors":"Zakaria Bouziane, A. Finkel","doi":"10.1016/S1571-0661(05)80423-2","DOIUrl":"https://doi.org/10.1016/S1571-0661(05)80423-2","url":null,"abstract":"","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"57 62 1","pages":"15-24"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83660854","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}
引用次数: 16
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信