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

信息与控制最新文献

筛选
英文 中文
Syntax directed analysis of liveness properties of while programs 语法导向的while程序的动态特性分析
信息与控制 Pub Date : 1986-01-01 Epub Date: 2005-05-04 DOI: 10.1016/S0019-9958(86)80037-7
Krzysztof R. Apt, Carole Delporte-Gallet
{"title":"Syntax directed analysis of liveness properties of while programs","authors":"Krzysztof R. Apt,&nbsp;Carole Delporte-Gallet","doi":"10.1016/S0019-9958(86)80037-7","DOIUrl":"https://doi.org/10.1016/S0019-9958(86)80037-7","url":null,"abstract":"<div><p>A syntax directed proof system which allows to prove <em>liveness</em> properties of <strong>while</strong>-programs is introduced. The proof system is proved to be arithmetically sound and complete in the sense of <span>Harel (“Lecture Notes in Comput. Sci. Vol. 68,” Springer-Verlag, Berlin/New York, 1979)</span>. The results of the paper generalize a corresponding result <span>Pneuli (“Prc. 18th Sympos. FOCS” IEEE, Providence, R. I., 1977)</span> proves for unstructured programs. The proof system decomposes into two parts. The first part allows to prove simple <em>safety</em> properties. These properties are used as axioms in the second proof system which deals with <em>liveness</em> properties. The completeness proof is constructive and provides a heuristic for proving specific liveness properties.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"68 1","pages":"Pages 223-253"},"PeriodicalIF":0.0,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80037-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92021805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems Gröbner基与Church-Rosser交换苏系统的超指数下界
信息与控制 Pub Date : 1986-01-01 Epub Date: 2005-05-04 DOI: 10.1016/S0019-9958(86)80035-3
Dung T. Huynh
{"title":"A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems","authors":"Dung T. Huynh","doi":"10.1016/S0019-9958(86)80035-3","DOIUrl":"10.1016/S0019-9958(86)80035-3","url":null,"abstract":"<div><p>The complexity of the normal form algorithms which transform a given polynomial ideal basis into a Gröbner basis or a given commutative Thue system into a Church-Rosser system is presently unknown. In this paper we derive a double-exponential lower bound (2<sup>2<em>n</em>C</sup>) for the production length and cardinality of Church-Rosser commutative Thue systems, and the degree and cardinality of Gröbner bases.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"68 1","pages":"Pages 196-206"},"PeriodicalIF":0.0,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80035-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83356963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 54
Probabilistic analysis of a network resource allocation algorithm 网络资源分配算法的概率分析
信息与控制 Pub Date : 1986-01-01 Epub Date: 2005-05-04 DOI: 10.1016/S0019-9958(86)80028-6
Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas
{"title":"Probabilistic analysis of a network resource allocation algorithm","authors":"Nancy A. Lynch,&nbsp;Nancy D. Griffeth,&nbsp;Michael J. Fischer,&nbsp;Leonidas J. Guibas","doi":"10.1016/S0019-9958(86)80028-6","DOIUrl":"10.1016/S0019-9958(86)80028-6","url":null,"abstract":"<div><p>A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, once allocated, are never returned. The algorithm searches sequentially, exhausting certain neighborhoods of the request origin before proceeding to search at greater distances. Choice of search direction is made non-deterministically. Analysis of expected response time is simplified by assuming that the search direction is chosen probabilistically, that messages require constant time, that the network is a tree with all leaves at the same distance from the root, and that requests and resources occur only at leaves. It is shown that the response time is approximated by the number of messages of one type that are sent during the execution of the algorithm, and that this number of messages is a nondecreasing function of the interarrival time for requests. Therefore, the worst case occurs when requests come in so far apart that they are processed sequentially. The expected time for the sequential case of the algorithm is analyzed by standard techniques. This time is shown to be bounded by a constant, independent of the size of the network. It follows that the expected response time for the algorithm is bounded in the same way.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"68 1","pages":"Pages 47-85"},"PeriodicalIF":0.0,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80028-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83753013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
A logic for the description of non-deterministic programs and their properties 描述非确定性程序及其性质的一种逻辑
信息与控制 Pub Date : 1986-01-01 Epub Date: 2005-05-04 DOI: 10.1016/S0019-9958(86)80038-9
S. Graf, J. Sifakis
{"title":"A logic for the description of non-deterministic programs and their properties","authors":"S. Graf,&nbsp;J. Sifakis","doi":"10.1016/S0019-9958(86)80038-9","DOIUrl":"10.1016/S0019-9958(86)80038-9","url":null,"abstract":"<div><p>We present a logic, called <em>Synchronization Tree Logic</em> (STL), for the specification and proof of programs described in a simple term language obtained from a constant <strong>Nil</strong> by using a set <strong>A</strong> of unary operators, a binary operator <strong>+</strong> and <strong>recursion</strong>. The elements of <em>A</em> represent names of actions, + represents non-deterministic choice, and Nil is the program preforming no action. The language of formulas of the logic proposed, contains the term language used for the description of programs, i.e., programs are formulas of the logic. This provides a uniform frame to deal with programs and their properties as the verification of anassertion <strong>t</strong> ⊨ <strong>f</strong> (<em>t</em> is a program, <em>f</em> is a formula) is reduced to the proof of the validity of the formula <strong>t</strong> ⊃ <strong>f</strong>. We propose a sound and under some conditions complete deductive system for synchronization tree logics and discuss their relation with modal logics used for the specification of programs.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"68 1","pages":"Pages 254-270"},"PeriodicalIF":0.0,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80038-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84919575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 51
An optimally data efficient isomorphism inference algorithm 一种数据效率最佳的同构推理算法
信息与控制 Pub Date : 1986-01-01 Epub Date: 2005-05-04 DOI: 10.1016/S0019-9958(86)80036-5
Peter A. Flangan
{"title":"An optimally data efficient isomorphism inference algorithm","authors":"Peter A. Flangan","doi":"10.1016/S0019-9958(86)80036-5","DOIUrl":"10.1016/S0019-9958(86)80036-5","url":null,"abstract":"<div><p>The time, space, and data complexity of an optimally data efficient isomorphism identification algorithm are presented. The data complexity, the amount of data required for an inference algorithm to terminate, is analyzed and shown to be the minimum possible for all possible isomorphism inference algorithms. The minimum data requirement is shown to be ⌈log<sub>2</sub> (<em>n</em>)⌉, and a method for constructing this minimal sequence of data is presented. The average data requirement is shown to be approximately 2 log<sub>2</sub>(<em>n</em>). The time complexity is <em>O</em>(<em>n</em><sup>2</sup>log<sub>2</sub>(<em>n</em>)) and the space requirement is <em>O</em>(<em>n</em><sup>2</sup>)</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"68 1","pages":"Pages 207-222"},"PeriodicalIF":0.0,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80036-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74865797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Simulation of Large Networks on Smaller Networks 大型网络在小型网络上的模拟
信息与控制 Pub Date : 1985-12-01 DOI: 10.1007/BFb0023994
H. Bodlaender, J. Leeuwen
{"title":"Simulation of Large Networks on Smaller Networks","authors":"H. Bodlaender, J. Leeuwen","doi":"10.1007/BFb0023994","DOIUrl":"https://doi.org/10.1007/BFb0023994","url":null,"abstract":"","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"28 1","pages":"47-58"},"PeriodicalIF":0.0,"publicationDate":"1985-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89917904","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}
引用次数: 36
Uniform characterizations of non-uniform complexity measures 非统一复杂性度量的统一表征
信息与控制 Pub Date : 1985-10-01 Epub Date: 2005-05-02 DOI: 10.1016/S0019-9958(85)80026-7
José L. Balcázar, Josep Díaz, Joaquim Gabarró
{"title":"Uniform characterizations of non-uniform complexity measures","authors":"José L. Balcázar,&nbsp;Josep Díaz,&nbsp;Joaquim Gabarró","doi":"10.1016/S0019-9958(85)80026-7","DOIUrl":"10.1016/S0019-9958(85)80026-7","url":null,"abstract":"<div><p>Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bounds.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 53-69"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80026-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80852843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Author index for volume 67 第67卷作者索引
信息与控制 Pub Date : 1985-10-01 Epub Date: 2005-05-02 DOI: 10.1016/S0019-9958(85)80037-1
{"title":"Author index for volume 67","authors":"","doi":"10.1016/S0019-9958(85)80037-1","DOIUrl":"https://doi.org/10.1016/S0019-9958(85)80037-1","url":null,"abstract":"","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Page 223"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80037-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136515132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The critical complexity of all (monotone) boolean functions and monotone graph properties 所有(单调)布尔函数的临界复杂度和单调图的性质
信息与控制 Pub Date : 1985-10-01 Epub Date: 2005-05-02 DOI: 10.1016/S0019-9958(85)80036-X
Ingo Wegner
{"title":"The critical complexity of all (monotone) boolean functions and monotone graph properties","authors":"Ingo Wegner","doi":"10.1016/S0019-9958(85)80036-X","DOIUrl":"10.1016/S0019-9958(85)80036-X","url":null,"abstract":"<div><p>CREW-PRAM's are a powerful model of parallel computers. Lower bounds for this model are rather general. Cook, Dwork, and Reischuk upper and lower time bounds for parallel random access machines without simultaneous writes, <em>SIAM J. Comput.</em> (in press) proved that the CREW-PRAM complexity of Boolean functions is bounded by log<em><sub>b</sub> c</em>(<em>f</em>), where <em>b</em> ≈ 4.79 and <em>c</em>(<em>f</em>) is the critical complexity of <em>f</em>. This lower bound is often even tight. For a class of functions <em>F</em> the critical complexity <em>c</em>(<em>F</em>), the minimum of all <em>c</em>(<em>f</em>) where <em>f</em> ∈ <em>F</em>, is the best general lower bound on the critical complexity of all <em>f</em> ∈ <em>F</em>. We determine the critical complexity of the set of all nondegenerate Boolean functions and all monotone nondegenerate Boolean functions up to a small additive term. And we compute exactly the critical complexity of the class of all monotone graph properties, proving partially a conjecture of <span>Turán (1984)</span>.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 212-222"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80036-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82787816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 28
Alternation with restrictions on looping 带有循环限制的交替
信息与控制 Pub Date : 1985-10-01 Epub Date: 2005-05-02 DOI: 10.1016/S0019-9958(85)80023-1
J.M. Robson
{"title":"Alternation with restrictions on looping","authors":"J.M. Robson","doi":"10.1016/S0019-9958(85)80023-1","DOIUrl":"10.1016/S0019-9958(85)80023-1","url":null,"abstract":"<div><p>Alternating Turing machines with restrictions preventing them from returning to a previous configuration model games with rules enforcing such a restriction, for instance, the Chinese version of Go. Such restrictions do not affect the time complexity of problems for alternating Turing machines but space <em>S</em> on a machine with the restriction is equivalent either to time or to space exponential in <em>S</em> on a normal alternating machine, depending on the precise nature of the restriction.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 2-11"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80023-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79317993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
首页 上一页 下一页 尾页
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学术官方微信
小红书