DOCSLIB.ORG

Model Checking Infinite-State Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Model Checking Infinite-State Systems Model Checking Infinite-State Systems: Generic and Specific Approaches Anthony Widjaja To I V N E R U S E I T H Y T O H F G E R D I N B U Doctor of Philosophy Laboratory for Foundations of Computer Science School of Informatics University of Edinburgh 2010 Abstract Model checking is a fully-automatic formal verification method that has been ex- tremely successful in validating and verifying safety-critical systems in the past three decades. In the past fifteen years, there has been a lot of work in extending many model checking algorithms over finite-state systems to finitely representable infinite- state systems. Unlike in the case of finite systems, decidability can easily become a problem in the case of infinite-state model checking. In this thesis, we present generic and specific techniques that can be used to derive decidability with near-optimal computational complexity for various model checking problems over infinite-state systems. Generic techniques and specific techniques pri- marily differ in the way in which a decidability result is derived. Generic techniques is a “top-down” approach wherein we start with a Turing-powerful formalism for infinite- state systems (in the sense of being able to generate the computation graphs of Turing machines up to isomorphisms), and then impose semantic restrictions whereby the desired model checking problem becomes decidable. In other words, to show that a subclass of the infinite-state systems that is generated by this formalism is decidable with respect to the model checking problem under consideration, we will simply have to prove that this subclass satisfies the semantic restriction. On the other hand, spe- cific techniques is a “bottom-up” approach in the sense that we restrict to a non-Turing powerful formalism of infinite-state systems at the outset. The main benefit of generic techniques is that they can be used as algorithmic metatheorems, i.e., they can give unified proofs of decidability of various model checking problems over infinite-state systems. Specific techniques are more flexible in the sense they can be used to derive decidability or optimal complexity when generic techniques fail. In the first part of the thesis, we adopt word/tree automatic transition systems as a generic formalism of infinite-state systems. Such formalisms can be used to gener- ate many interesting classes of infinite-state systems that have been considered in the literature, e.g., the computation graphs of counter systems, Turing machines, push- down systems, prefix-recognizable systems, regular ground-tree rewrite systems, PA- processes, order-2 collapsible pushdown systems. Although the generality of these formalisms make most interesting model checking problems (even safety) undecid- able, they are known to have nice closure and algorithmic properties. We use these nice properties to obtain several algorithmic metatheorems over word/tree automatic systems, e.g., for deriving decidability of various model checking problems including recurrent reachability, and Linear Temporal Logic (LTL) with complex fairness con- i straints. These algorithmic metatheorems can be used to uniformly prove decidability with optimal (or near-optimal) complexity of various model checking problems over many classes of infinite-state systems that have been considered in the literature. In fact, many of these decidability/complexity results were not previously known in the literature. In the second part of the thesis, we study various model checking problems over subclasses of counter systems that were already known to be decidable. In particu- lar, we consider reversal-bounded counter systems (and their extensions with discrete clocks), one-counter processes, and networks of one-counter processes. We shall de- rive optimal complexity of various model checking problems including: model check- ing LTL, EF-logic, and first-order logic with reachability relations (and restrictions thereof). In most cases, we obtain a single/double exponential reduction in the previ- ously known upper bounds on the complexity of the problems. ii Acknowledgements First and foremost, I would like to express my deepest gratitude to my supervisor Leonid Libkin for his teaching, guidance and sound advice throughout my PhD studies. I have learnt a lot from him about many aspects of logic and automata, which I would unlikely have looked at otherwise. His teaching and discussions have always been a source of inspirations. Leonid has also helped me with many academic and personal issues that I encountered throughout my PhD studies. I cannot thank him enough for all these helps. I would also like to thank my co-supervisor Richard Mayr for his guidance and his inspiring introduction to the area of verification of infinite-state systems. I have lost count of how many hours of useful discussions about research which we have had in the last two years. I am honored to have Luke Ong and Colin Stirling as my PhD examiners. Thank you for going through the thesis and providing a lot of useful feedback. I would also like to thank Stefan G¨oller and Matthew Hague for the fruitful col- laborations that we have had throughout my PhD studies. I look forward to work- ing closely together again in the near future. In addition, I am grateful to many other colleagues presently or previously at the School of Informatics with whom I have had many useful discussions: Shunichi Amano, Lorenzo Clemente, Claire David, Christophe Dubach, Kousha Etessami, Floris Geerts, Luis Fabricio Wanderley Goes, Julian Gutierrez, Xibei Jia, Shuai Ma, Filip Murlak, Vasileios Porpodas, Juan Reutter, Rahul Santhanam, Karthik T. Sundararajan, Tony Tan, and Yinghui Wu. I would also like to thank colleagues from other institutes with whom I have had useful research dis- cussions throughout my PhD studies: Vince Barany, Pablo Barcelo, Eryk Kopczynski, Jerome Leroux, Christof L¨oding, Christophe Morvan, and Sanming Zhou. I would also like to acknowledge many teachers and colleagues from Australia who have been a great source of inspiration. In particular, I thank James Bailey, Harald Sondergaard, and Sanming Zhou for introducing me to theoretical computer science. I am also indebted to my mentors Mike Ciavarella and Benjamin Rubinstein for their personal and academic advice. My PhD studies have been made possible by Overseas Research Students Award Scheme and EPSRC grant E005039. Thank you for the generous support. Last but not least, I would like to thank my family and my girlfriend who have supported me personally throughout my PhD studies. This thesis is dedicated for you. iii Declaration I declare that this thesis was composed by myself, that the work contained herein is my own except where explicitly stated otherwise in the text, and that this work has not been submitted for any other degree or professional qualification except as specified. (Anthony Widjaja To) iv Table of Contents 1 Introduction 1 1.1 Specificapproaches........................... 4 1.2 Genericapproaches ........................... 8 1.3 Contributions .............................. 9 1.4 Organizations .............................. 12 2 Preliminaries 13 2.1 Generalnotations ............................ 13 2.2 Automatatheory ............................ 14 2.2.1 Automataoverfinitewords. 15 2.2.2 Automata over ω-words .................... 22 2.2.3 Automataovertrees . 23 2.2.4 Automataoverinfinitetrees . 29 2.2.5 Pushdownautomataandcontext-freegrammars . 30 2.2.6 Parikh’sTheoremandsemilinearsets . 31 2.3 Computabilityandcomplexitytheory . 33 2.3.1 Computability ......................... 33 2.3.2 Complexitytheory . .. .. .. .. .. .. 34 2.4 Structuresandtransitionsystems . .. 37 2.5 Logicsandproperties . .. .. .. .. .. .. .. 38 2.5.1 Safety,liveness,andfairness . 39 2.5.2 Reachability and recurrent reachability . .. 40 2.5.3 FO:First-orderlogic . .. .. .. .. .. .. 41 2.5.4 FOREG(Reach): FO withregularreachability . 44 2.5.5 HM-logic:Hennessy-MilnerLogic . 45 2.5.6 EFREG-logic: HM-logicwithregularreachability . 46 2.5.7 CTL:ComputationTreelogic . 47 v 2.5.8 LTL:LinearTemporalLogic . 48 2.5.9 Otherlogics........................... 49 2.5.10 Modelcheckingcomplexity . 50 I Generic Approaches: Algorithmic Metatheorems 53 3 Word/Tree-automatic Systems 55 3.1 Word-automaticsystems . 56 3.1.1 Basicdefinitions ........................ 56 3.1.2 Examples............................ 58 3.1.3 Basicclosureandalgorithmicresults . 62 3.1.4 Negativeresults.. .. .. .. .. .. .. 67 3.2 Tree-automaticsystems. 69 3.2.1 Basicdefinitions ........................ 69 3.2.2 Examples............................ 71 3.2.3 Basicclosureandalgorithmicresults . 73 3.2.4 Negativeresults.. .. .. .. .. .. .. 75 3.3 Othergenericframeworks . 75 3.3.1 Length-preserving word-automatic transition systems..... 75 3.3.2 Presburgertransitionsystems. 77 3.3.3 Rationaltransitionsystems. 78 3.3.4 ω-wordautomatictransitionsystems. 80 4 Algorithmic metatheorems for recurrent reachability 81 4.1 Theword-automaticcase . 83 4.1.1 Maintheorem.......................... 83 4.1.2 Proofofthemaintheorem . 84 4.1.3 Asmallwitnessforrecurrentreachability . .. 91 4.1.4 Twoappetizerexamples . 92 4.2 Thetree-automaticcase. 95 4.2.1 Maintheorem.......................... 95 4.2.2 Preliminaries .......................... 96 4.2.3 Proofofthemaintheorem . 97 4.2.4 Anappetizerexample . 105 4.3 GeneralizedB¨uchiconditions. 106 vi 4.3.1 Word-automaticsystems . 107 4.3.2 Tree-automaticsystems. 107 4.3.3 Applications .......................... 108 4.4 Recurrentreachabilityviaapproximation . .... 110 5 Algorithmic metatheorems
Load more

Recommended publications
  • Synchronizing Deterministic Push-Down Automata Can
    Synchronizing Deterministic Push-Down Automata Can Be Really Hard Henning Fernau Universität Trier, Fachbereich IV, Informatikwissenschaften, 54296 Trier, Germany [email protected] Petra Wolf Universität Trier, Fachbereich IV, Informatikwissenschaften, 54296 Trier, Germany https://www.wolfp.net/ [email protected] Tomoyuki Yamakami University of Fukui, Faculty of Engineering, 3-9-1 Bunkyo, Fukui 910-8507, Japan [email protected] Abstract The question if a deterministic finite automaton admits a software reset in the form of a so- called synchronizing word can be answered in polynomial time. In this paper, we extend this algorithmic question to deterministic automata beyond finite automata. We prove that the question of synchronizability becomes undecidable even when looking at deterministic one-counter automata. This is also true for another classical mild extension of regularity, namely that of deterministic one-turn push-down automata. However, when we combine both restrictions, we arrive at scenarios with a PSPACE-complete (and hence decidable) synchronizability problem. Likewise, we arrive at a decidable synchronizability problem for (partially) blind deterministic counter automata. There are several interpretations of what synchronizability should mean for deterministic push- down automata. This is depending on the role of the stack: should it be empty on synchronization, should it be always the same or is it arbitrary? For the automata classes studied in this paper, the complexity or decidability status of the synchronizability
    [Show full text]
  • How to Go Beyond Turing with P Automata: Time Travels, Regular Observer Ω-Languages, and Partial Adult Halting
    How to Go Beyond Turing with P Automata: Time Travels, Regular Observer !-Languages, and Partial Adult Halting Rudolf Freund1, Sergiu Ivanov2, and Ludwig Staiger3 1 Technische Universit¨atWien, Austria Email: [email protected] 2 Universit´eParis Est, France Email: [email protected] 3 Martin-Luther-Universit¨atHalle-Wittenberg, Germany Email: [email protected] Summary. In this paper we investigate several variants of P automata having infinite runs on finite inputs. By imposing specific conditions on the infinite evolution of the systems, it is easy to find ways for going beyond Turing if we are watching the behavior of the systems on infinite runs. As specific variants we introduce a new halting variant for P automata which we call partial adult halting with the meaning that a specific predefined part of the P automaton does not change any more from some moment on during the infinite run. In a more general way, we can assign !-languages as observer languages to the infinite runs of a P automaton. Specific variants of regular !-languages then, for example, characterize the red-green P automata. 1 Introduction Various possibilities how one can \go beyond Turing" are discussed in [11], for example, the definitions and results for red-green Turing machines can be found there. In [2] the notion of red-green automata for register machines with input strings given on an input tape (often also called counter automata) was introduced and the concept of red-green P automata for several specific models of membrane systems was explained. Via red-green counter automata, the results for acceptance and recognizability of finite strings by red-green Turing machines were carried over to red-green P automata.
    [Show full text]
  • Constraints for Membership in Formal Languages Under Systematic Search and Stochastic Local Search
    Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1027 Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search JUN HE ACTA UNIVERSITATIS UPSALIENSIS ISSN 1651-6214 ISBN 978-91-554-8617-4 UPPSALA urn:nbn:se:uu:diva-196347 2013 Dissertation presented at Uppsala University to be publicly examined in Room 2446, Polacksbacken, Lägerhyddsvägen 2D, Uppsala, Friday, April 26, 2013 at 13:00 for the degree of Doctor of Philosophy. The examination will be conducted in English. Abstract He, J. 2013. Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search. Acta Universitatis Upsaliensis. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1027. 74 pp. Uppsala. ISBN 978-91-554-8617-4. This thesis focuses on constraints for membership in formal languages under both the systematic search and stochastic local search approaches to constraint programming (CP). Such constraints are very useful in CP for the following three reasons: They provide a powerful tool for user- level extensibility of CP languages. They are very useful for modelling complex work shift regulation constraints, which exist in many shift scheduling problems. In the analysis, testing, and verification of string-manipulating programs, string constraints often arise. We show in this thesis that CP solvers with constraints for membership in formal languages are much more suitable than existing solvers used in tools that have to solve string constraints. In the stochastic local search approach to CP, we make the following two contributions: We introduce a stochastic method of maintaining violations for the regular constraint and extend our method to the automaton constraint with counters.
    [Show full text]
  • Truth and Provability
    Truth and provability Herman Ruge Jervell May 24, 2009 2 Contents 0.1 Incompleteness . 7 0.2 Truth . 8 0.3 Thinking from assumptions . 8 0.4 The pioneers . 9 1 Data structures and syntax 11 1.1 Skolems paper . 11 1.2 Pairs . 12 1.3 The language of pairs . 12 1.4 Representing syntax by pairs . 13 1.5 Natural numbers . 15 2 Elementary theories of syntax 19 2.1 The elementary theories . 19 2.2 The minimal theory . 19 2.3 Robinson theory . 21 2.4 Non standard models . 22 2.5 Induction . 23 2.6 Skolem theory . 23 3 Decidable theories 25 3.1 Decidable versus undecidable . 25 3.2 Automata theory . 25 3.3 Logic of acceptance . 27 3.4 Presburger arithmetic . 28 3.5 Arithmetic with only multiplication . 28 3.6 Numbers with addition and multiplication . 29 3.7 Infinite input . 29 3.8 Complement of infinite strings . 34 3.9 Complement of infinite trees . 35 4 Diagonalization 39 4.1 Cantors argument . 39 4.2 Russells paradox . 40 4.3 Fix point of functions . 41 3 4 CONTENTS 4.4 Diagonal lemma . 41 4.5 Self reference . 42 4.6 Currys paradox . 44 5 Provability 45 5.1 Representing syntax . 45 5.2 Provability as necessity . 46 5.3 Tarskis theorem . 49 5.4 Consistency . 49 5.5 G¨odels first incompleteness theorem . 50 5.6 G¨odels second incompleteness theorem . 50 6 Modality 53 6.1 The G¨odel-L¨obmodal logic . 53 6.2 Solovays first completeness theorem . 57 6.3 Solovays second completeness teorem .
    [Show full text]
  • Computing Downward Closures for Stacked Counter Automata
    Computing Downward Closures for Stacked Counter Automata Georg Zetzsche AG Concurrency Theory Fachbereich Informatik TU Kaiserslautern [email protected] Abstract The downward closure of a language L of words is the set of all (not necessarily contiguous) subwords of members of L. It is well known that the downward closure of any language is regular. Although the downward closure seems to be a promising abstraction, there are only few language classes for which an automaton for the downward closure is known to be computable. It is shown here that for stacked counter automata, the downward closure is computable. Stacked counter automata are finite automata with a storage mechanism obtained by adding blind counters and building stacks. Hence, they generalize pushdown and blind counter automata. The class of languages accepted by these automata are precisely those in the hierarchy ob- tained from the context-free languages by alternating two closure operators: imposing semilinear constraints and taking the algebraic extension. The main tool for computing downward closures is the new concept of Parikh annotations. As a second application of Parikh annotations, it is shown that the hierarchy above is strict at every level. 1998 ACM Subject Classification F.4.3 Formal languages Keywords and phrases abstraction, downward closure, obstruction set, computability 1 Introduction In the analysis of systems whose behavior is given by formal languages, it is a fruitful idea to consider abstractions: simpler objects that preserve relevant properties of the language and are amenable to algorithmic examination. A well-known such type of abstraction is the Parikh image, which counts the number of occurrences of each letter.
    [Show full text]
  • Regulated Rewriting in Formal Language Theory
    Regulated Rewriting in Formal Language Theory by: Mohamed A.M.S Taha Thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at the University of Stellenbosch Supervisor: Prof. A.B. van der Merwe March, 2008 Declaration I, the undersigned, hereby declare that the work contained in this thesis is my own original work and has not previously in its entirety or in part been submitted at any university for a degree. Signature: ............. Date: ............. Copyright c 2008 Stellenbosch University All rights reserved i Abstract Context-free grammars are well-studied and well-behaved in terms of decidability, but many real-world problems cannot be described with context-free grammars. Grammars with regu- lated rewriting are grammars with mechanisms to regulate the applications of rules, so that certain derivations are avoided. Thus, with context-free rules and regulated rewriting mech- anisms, one can often generate languages that are not context-free. In this thesis we study grammars with regulated rewriting mechanisms. We consider prob- lems in which context-free grammars are insufficient and in which more descriptive grammars are required. We compare bag context grammars with other well-known classes of grammars with regulated rewriting mechanisms. We also discuss the relation between bag context gram- mars and recognizing devices such as counter automata and Petri net automata. We show that regular bag context grammars can generate any recursively enumerable language. We reformulate the pumping lemma for random permitting context languages with context-free rules, as introduced by Ewert and Van der Walt, by using the concept of a string homomor- phism.
    [Show full text]
  • Purity in Arithmetic: Some Formal and Informal Issues
    PURITY IN ARITHMETIC: SOME FORMAL AND INFORMAL ISSUES ANDREW ARANA 1. INTRODUCTION There has been since antiquity a tradition in mathematics of preferring solutions to problems / proofs of theorems that are restricted to considerations “close” or “intrinsic” to what is being solved/proved. A classical example of such preference is the desire for “synthetic” geometrical solutions to geometrical problems rather than “analytic” solutions to those problems that have struck many mathematicians as “rather far” from the problems at hand. Arithmetic in particular has been the locus of much concern over purity. For instance, regarding Hadamard and de la Vallee´ Poussin’s 1896 proof of the prime number theorem using complex analysis, the distinguished number theorist A.E. Ingham remarked that it “may be held to be unsatisfactory in that it introduces ideas very remote from the original problem, and it is natural to ask for a proof of the prime number theorem not depending on the theory of a complex variable” (cf. [Ing32], pp. 5–6). Investigation of purity in mathematical practice reveals that there are several different strains of purity differentiated by how they measure what is “close” or “intrinsic” to what is being solved/proved. In [DA11] we settled on one such strain as the one most central to purity in historical practice, which we called the “topical” strain.1 Very roughly, a solution to a problem is “topically pure” if it draws only on what is “contained” in (the content of) that problem, where what is “contained” in a problem is what grounds its understanding and is what we call that problem’s “topic”.
    [Show full text]
  • Highly Undecidable Problems for Infinite Computations Olivier Finkel
    Highly Undecidable Problems For Infinite Computations Olivier Finkel To cite this version: Olivier Finkel. Highly Undecidable Problems For Infinite Computations. RAIRO - Theoretical Infor- matics and Applications (RAIRO: ITA), EDP Sciences, 2009, 43 (2), pp.339-364. hal-00349761 HAL Id: hal-00349761 https://hal.archives-ouvertes.fr/hal-00349761 Submitted on 4 Jan 2009 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Theoretical Informatics and Applications Will be set by the publisher Informatique Th´eorique et Applications HIGHLY UNDECIDABLE PROBLEMS FOR INFINITE COMPUTATIONS Olivier Finkel1 Abstract. We show that many classical decision problems about 1- counter ω-languages, context free ω-languages, or infinitary rational 1 relations, are Π2-complete, hence located at the second level of the analytical hierarchy, and “highly undecidable”. In particular, the uni- versality problem, the inclusion problem, the equivalence problem, the determinizability problem, the complementability problem, and the un- 1 ambiguity problem are all Π2-complete for context-free ω-languages or for infinitary rational relations. Topological and arithmetical proper- ties of 1-counter ω-languages, context free ω-languages, or infinitary rational relations, are also highly undecidable. These very surprising results provide the first examples of highly undecidable problems about the behaviour of very simple finite machines like 1-counter automata or 2-tape automata.
    [Show full text]
  • Decision Problems for Skolem Arithmetic*
    Theoretical Computer Science 11 (1980) 123-143 @ North-Holland Publishing Company THE REACHABILITY PROBLEM FOR PETRI NETS AND DECISION PROBLEMS FOR SKOLEM ARITHMETIC* Egon BURGER Lehrstuhl Informatik II, Universitiit Dortrnund, D-4600 Dortmund SO, ERG. Hans KLEINE BONING Institut fiir mathematische Logik und Grundlagenforschung, D-4400 Miinster, F.R.G. Communicated by M. Nivat Received March 1978 Revised May 1979 Abstract. We show that the decision problem for the class COof all closed universal Horn formulae in prenex conjunctive normal form of extended Skolem arithmetic without equality (i.e. first order formulae built up from the multiplication sign, constants for the natural numbers and free occurring predicate symbols) is exponentially time bounded equivalent to the reachability problem for Petri nets if restricted to the class of formulae with (a) only monadic predicate symbols, with (6) only binary disjunctions in the quantifier free matrix and (c) without terms containing a variable more than once. We show that leaving out one of the restrictions (a) to (c) yields classes of formulae whose decision problem can assume any prescribed recursively enumerable complexity in terms of many-one degrees of unsolvability. 1. Introduction In the course of various attempts to solve the reachability problem for Petri nets’ by describing it thr ough logical formulae in classes with recursively solvable decision problem we found an interesting class of formulae whose decision problem not only incorporates the reachability problem bue is exponentially time bounded reducible to it and which cannot be extended in its expressive power with respect to certain well known criteria of logical complexity of formulae without yielding a class with recursively unsolvable-even arbitrarily Fomplex recursively enumerable-decision problem.
    [Show full text]
  • Set Theory and Its Philosophy : a Critical Introduction
    This page intentionally left blank Set Theory and its Philosophy This page intentionally left blank Set Theory and its Philosophy A Critical Introduction Michael Potter 3 3 Great Clarendon Street, Oxford OX2 6DP Oxford University Press is a department of the University of Oxford. It furthers the University’s objective of excellence in research, scholarship, and education by publishing worldwide in Oxford New York Auckland Bangkok Buenos Aires Cape Town Chennai Dar es Salaam Delhi Hong Kong Istanbul Karachi Kolkata Kuala Lumpur Madrid Melbourne Mexico City Mumbai Nairobi Sao˜ Paulo Shanghai Taipei Tokyo Toronto Oxford is a registered trade mark of Oxford University Press in the UK and certain other countries Published in the United States by Oxford University Press Inc., New York c Michael Potter 2004 The moral rights of the author have been asserted Database right Oxford University Press (maker) First published 2004 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission in writing of Oxford University Press, or as expressly permitted by law, or under terms agreed with the appropriate reprographics rights organizations. Enquiries concerning reproduction outside the scope of the above should be sent to the Rights Department, Oxford University Press, at the address above You must not circulate this book in any other binding or cover and you must impose the same condition on any acquirer British Library Cataloguing in Publication Data Data available Library of Congress Cataloging in Publication Data Data available ISBN 0–19–926973–4 (hbk.) ISBN 0–19–927041–4 (pbk.) 13579108642 Typeset by the author Printed in Great Britain on acid-free paper by T J International Ltd., Padstow, Cornwall Preface This book was written for two groups of people, philosophically informed mathematicians with a serious interest in the philosophy of their subject, and philosophers with a serious interest in mathematics.
    [Show full text]
  • Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words Olivier Finkel
    Incompleteness Theorems, Large Cardinals, and Automata over Finite Words Olivier Finkel To cite this version: Olivier Finkel. Incompleteness Theorems, Large Cardinals, and Automata over Finite Words. 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017., Apr 2017, Bern, Switzerland. pp.231 - 246, 10.1007/978-3-319-55911-7. hal-01588572 HAL Id: hal-01588572 https://hal.archives-ouvertes.fr/hal-01588572 Submitted on 15 Sep 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Incompleteness Theorems, Large Cardinals, and Automata over Finite Words Olivier Finkel Institut de Math´ematiques de Jussieu - Paris Rive Gauche CNRS et Universit´eParis 7, France. [email protected] Abstract. We prove that one can construct various kinds of automata over finite words for which some elementary properties are actually in- dependent from strong set theories like Tn =:ZFC + “There exist (at least) n inaccessible cardinals”, for integers n ≥ 0. In particular, we prove independence results for languages of finite words generated by context- free grammars, or accepted by 2-tape or 1-counter automata. Moreover we get some independence results for weighted automata and for some related finitely generated subsemigroups of the set Z3×3 of 3-3 matrices with integer entries.
    [Show full text]
  • Rule-Restricted Automaton-Grammar Transducers: Power and Linguistic Applications
    Math. Appl. 1 (2012), 13{35 RULE-RESTRICTED AUTOMATON-GRAMMAR TRANSDUCERS: POWER AND LINGUISTIC APPLICATIONS MARTIN CERMˇ AK,´ PETR HORA´ CEKˇ and ALEXANDER MEDUNA Abstract. This paper introduces the notion of a new transducer as a two-component system, which consists of a finite automaton and a context-free grammar. In essence, while the automaton reads its input string, the grammar produces its output string, and their cooperation is controlled by a set, which restricts the usage of their rules. From a theoretical viewpoint, the present paper discusses the power of this sys- tem working in an ordinary way as well as in a leftmost way. In addition, the paper introduces an appearance checking, which allows us to check whether some symbols are present in the rewritten string, and studies its effect on the power. It achieves the following three main results. First, the system generates and accepts languages defined by matrix grammars and partially blind multi-counter automata, respec- tively. Second, if we place a leftmost restriction on derivation in the context-free grammar, both accepting and generating power of the system is equal to generative power of context-free grammars. Third, the system with appearance checking can accept and generate all recursively enumerable languages. From more pragmatical viewpoint, this paper describes several linguistic applications. A special attention is paid to the Japanese-Czech translation. 1. Introduction In formal language theory, there exist two basic translation-method categories. The first category contains interprets and compilers, which first analyse an input string in the source language and, after that, they generate a corresponding output string in the target language (see [2], [18], [21], [14], or [22]).
    [Show full text]