信息与控制Pub Date : 1985-01-01DOI: 10.1016/S0019-9958(85)80047-4
D. Harel, R. Sherman
{"title":"Propositional dynamic logic of flowcharts","authors":"D. Harel, R. Sherman","doi":"10.1016/S0019-9958(85)80047-4","DOIUrl":"10.1016/S0019-9958(85)80047-4","url":null,"abstract":"<div><p>Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nondeterministic finite automata over atomic programs and tests (i.e., flowcharts), rather than regular expressions. While the resulting version of PDL, call it APDL, is clearly equivalent in expressive power to PDL, it is also (in the worst case) exponentially more succinct. In particular, deciding its validity problem by reducing it to that of PDL leads to a double exponential time procedure, although PDL itself is decidable in exponential time. We present an elementary combined proof of the completeness of a simple axiom system for APDL and decidability of the validity problem in exponential time. The results are thus stronger than those for PDL, since PDL can be encoded in APDL with no additional cost, and the proofs simpler, since induction on the structure of programs is virtually eliminated. Our axiom system for APDL relates to the PDL system just as Floyd's proof method for partial correctness relates to Hoare's.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80047-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72865924","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}
信息与控制Pub Date : 1985-01-01DOI: 10.1016/S0019-9958(85)80042-5
Rüdiger Reischuk
{"title":"A new solution for the Byzantine generals problem","authors":"Rüdiger Reischuk","doi":"10.1016/S0019-9958(85)80042-5","DOIUrl":"10.1016/S0019-9958(85)80042-5","url":null,"abstract":"<div><p>We define a new model for algorithms to reach Byzantine Agreement. It allows one to measure the complexity more accurately, to differentiate between processor faults, and to include communication link failures. A deterministic algorithm is presented that exhibits early stopping by phase 2<em>f</em> + 3 in the worst case, where <em>f</em> is the actual number of faults, under less stringent conditions than the ones of previous algorithms. Its average performance can also easily be analysed making realistic assumptions on random distribution of faults. We show that it stops with high probability after a small number of phases.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80042-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79412157","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}
信息与控制Pub Date : 1985-01-01DOI: 10.1016/S0019-9958(85)80044-9
Stefan Hertel, Kurt Mehlhorn
{"title":"Fast triangulation of the plane with respect to simple polygons","authors":"Stefan Hertel, Kurt Mehlhorn","doi":"10.1016/S0019-9958(85)80044-9","DOIUrl":"10.1016/S0019-9958(85)80044-9","url":null,"abstract":"<div><p>Let <em>P</em><sub>1</sub>,…, <em>P<sub>k</sub></em> be pairwise non-intersecting simple polygons with a total of <em>n</em> vertices and <em>s</em> start vertices. A start vertex, in general, is a vertex both of which neighbors have larger <em>x</em> coordinate. We present an algorithm for triangulating <em>P</em><sub>1</sub>,…, <em>P<sub>k</sub></em> in time <em>O</em>(<em>n</em> + <em>s</em> log <em>s</em>). <em>s</em> may be viewed as a measure of non-convexity. In particular, <em>s</em> is always bounded by the number of concave angles + 1, and is usually much smaller. We also describe two new applications of triangulation. Given a triangulation of the plane with respect to a set of <em>k</em> pairwise non-intersecting simple polygons, then the intersection of this set with a convex polygon <em>Q</em> can be computed in time linear with respect to the combined number of vertices of the <em>k</em> + 1 polygons. Such a result had only be known for two <em>convex polygons</em>. The other application improves the bound on the number of convex parts into which a polygon can be decomposed.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80044-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88428689","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}
信息与控制Pub Date : 1985-01-01DOI: 10.1016/S0019-9958(85)80041-3
Stephen A. Cook
{"title":"A taxonomy of problems with fast parallel algorithms","authors":"Stephen A. Cook","doi":"10.1016/S0019-9958(85)80041-3","DOIUrl":"10.1016/S0019-9958(85)80041-3","url":null,"abstract":"<div><p>The class <em>NC</em> consists of problems solvable very fast (in time polynomial in log <em>n</em>) in parallel with a feasible (polynomial) number of processors. Many natural problems in <em>NC</em> are known; in this paper an attempt is made to identify important subclasses of <em>NC</em> and give interesting examples in each subclass. The notion of <em>NC</em><sup>1</sup>-reducibility is introduced and used throughout (problem <em>R</em> is <em>NC</em><sup>1</sup>-reducible to problem <em>S</em> if <em>R</em> can be solved with uniform log-depth circuits using oracles for <em>S</em>). Problems complete with respect to this reducibility are given for many of the subclasses of <em>NC</em>. A general technique, the “parallel greedy algorithm,” is identified and used to show that finding a minimum spanning forest of a graph is reducible to the graph accessibility problem and hence is in <em>NC</em><sup>2</sup> (solvable by uniform Boolean circuits of depth <em>O</em>(log<sup>2</sup> <em>n</em>) and polynomial size). The class LOGCFL is given a new characterization in terms of circuit families. The class DET of problems reducible to integer determinants is defined and many examples given. A new problem complete for deterministic polynomial time is given, namely, finding the lexicographically first maximal clique in a graph. This paper is a revised version of S. A. Cook, (1983, <em>in</em> “Proceedings 1983 Intl. Found. Comut. Sci. Conf.,” Lecture Notes in Computer Science Vol. 158, pp. 78–93, Springer-Verlag, Berlin/New York).</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80041-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75878713","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}
信息与控制Pub Date : 1984-12-01DOI: 10.1016/S0019-9958(84)80015-7
M. Ajtai, M. Fredman, J. Komlós
{"title":"Hash functions for priority queues","authors":"M. Ajtai, M. Fredman, J. Komlós","doi":"10.1016/S0019-9958(84)80015-7","DOIUrl":"https://doi.org/10.1016/S0019-9958(84)80015-7","url":null,"abstract":"<div><p>The complexity of priority queue operations is analyzed with respect to the cell probe computational model of A. Yao (<em>J. Assoc. Comput. Mach.</em> <strong>28</strong>, No. 3 (1981), 615–628). A method utilizing families of hash functions is developed which permits priority queue operations to be implemented in constant worst-case time provided that a size constraint is satisfied. The minimum necessary size of a family of hash functions for computing the rank function is estimated and contrasted with the minimum size required for perfect hashing.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80015-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136520345","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}
信息与控制Pub Date : 1984-12-01DOI: 10.1016/S0019-9958(84)80013-3
Andrzej Ehrenfeucht, Grzegorz Rozenberg
{"title":"An easy proof of Greibach normal form","authors":"Andrzej Ehrenfeucht, Grzegorz Rozenberg","doi":"10.1016/S0019-9958(84)80013-3","DOIUrl":"10.1016/S0019-9958(84)80013-3","url":null,"abstract":"<div><p>We present an algorithm which given an arbitrary <em>A</em>-free context-free grammar produces an equivalent context-free grammar in 2 Greibach normal form. The upper bound on the size of the resulting grammar in terms of the size of the initially given grammar is given. Our algorithm consists of an elementary construction, while the upper bound on the size of the resulting grammar is not bigger than the bounds known for other algorithms for converting context-free grammars into equivalent context-free grammars in Greibach normal form.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80013-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81931448","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}
信息与控制Pub Date : 1984-12-01DOI: 10.1016/S0019-9958(84)80016-9
{"title":"Author index for volume 63","authors":"","doi":"10.1016/S0019-9958(84)80016-9","DOIUrl":"https://doi.org/10.1016/S0019-9958(84)80016-9","url":null,"abstract":"","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80016-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136520401","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}
信息与控制Pub Date : 1984-12-01DOI: 10.1016/S0019-9958(84)80012-1
D.S. Franzblau, D.J. Kleitman
{"title":"An algorithm for covering polygons with rectangles","authors":"D.S. Franzblau, D.J. Kleitman","doi":"10.1016/S0019-9958(84)80012-1","DOIUrl":"10.1016/S0019-9958(84)80012-1","url":null,"abstract":"<div><p>Decomposing a polygon into simple shapes is a basic problem in computational geometry, with applications in pattern recognition and integrated circuit manufacture. Here we examine the special case of covering a rectilinear polygon (or polyomino) with the minimum number of rectangles, with overlapping allowed. The problem is <em>NP</em>-hard. However, we give here an <em>O</em>(<em>v</em><sup>2</sup>) algorithm for constructing a minimum rectangle cover, when the polygon is vertically convex. (Here <em>v</em> is the number of vertices.) The problem is first reduced to a 1-dimensional interval “basis” problem. In showing our algorithm produces an optimal cover we give a new proof of a minimum basis-maximum independent set duality theorem first proved by E. Györi (<em>J. Combin Theory Ser. B</em> <strong>37</strong>, No. 1, 1–9).</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80012-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75717710","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}
信息与控制Pub Date : 1984-12-01DOI: 10.1016/S0019-9958(84)80011-X
Ralf Hartmut Güting
{"title":"Dynamic C-oriented polygonal intersection searching","authors":"Ralf Hartmut Güting","doi":"10.1016/S0019-9958(84)80011-X","DOIUrl":"10.1016/S0019-9958(84)80011-X","url":null,"abstract":"<div><p>A set of polygons is called <em>c</em>-oriented if the edges of all polygons are oriented in a constant number of previously defined directions. The intersection searching problem is studied for such objects, namely: Given a set of <em>c</em>-oriented polygons <em>P</em> and a <em>c</em>-oriented query polygon <em>q</em>, find all polygons in <em>P</em> that intersect <em>q</em>. It is shown that this problem can be solved in <em>O</em>(log<sup>2</sup> <em>n</em> + <em>t</em>) time with <em>O</em>(<em>n</em> log <em>n</em>) space and <em>O</em>(<em>n</em> log<sup>2</sup> <em>n</em>) preprocessing, where <em>n</em> is the cardinality of <em>P</em> and <em>t</em> the number of answers to a query. Furthermore, the solution is extended to the cases in which <em>P</em> is a semidynamic or dynamic set of polygons. Whereas planar intersection searching can be carried out more efficiently for orthogonal objects (e.g., rectangles) it is expensive for arbitrary polygons. This suggests that the <em>c</em>-oriented solution be used in appropriate areas of application, for instance, in VLSI-design.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80011-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80753056","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}