Transforming structures by set interpretations

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into a structure with a domain consisting of finite sets of elements of the orignal structure. The definition of these interpretations directly implies that they send structures with a decidable WMSO theory to structures with a decidable first-order theory. In this paper, we investigate the expressive power of such interpretations applied to infinite deterministic trees. The results can be used in the study of automatic and tree-automatic structures.

[1]  Ludwig Staiger,et al.  Finite Acceptance of Infinite Words , 1997, Theor. Comput. Sci..

[2]  Bruno Courcelle,et al.  The monadic second-order logic of graphs, II: Infinite graphs of bounded width , 1988, Mathematical systems theory.

[3]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[4]  Michael Portz,et al.  A New Class of Cryptosystems Based on Interconnection Networks , 1991 .

[5]  Kai Jakobs,et al.  Timer Handling in High-Performance Transport Systems , 1993, Integrated Broadband Communications.

[6]  Sophie Tison,et al.  The theory of ground rewrite systems is decidable , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[7]  Didier Caucal.  On Infinite Terms Having a Decidable Monadic Theory , 2002, MFCS.

[8]  Calvin C. Elgot,et al.  Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor , 1966, J. Symb. Log..

[9]  Wolfgang Thomas,et al.  Constructing Infinite Graphs with a Decidable MSO-Theory , 2003, MFCS.

[10]  J. Klop,et al.  WST ’ 04 7 th International Workshop on Termination , 2004 .

[11]  P. Madhusudan,et al.  Model-checking trace event structures , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[12]  Andy Schürr,et al.  Computing with Graphs and Graph Rewriting , 1999 .

[13]  Manfred Nagl,et al.  A universal component for the administration in distributed and integrated development environments , 1994 .

[14]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[15]  Bernhard Steffen,et al.  Model Checking for Context-Free Processes , 1992, CONCUR.

[16]  Andy Schürr.  Logic Based Programmed Structure Rewriting Systems , 1996, Fundam. Informaticae.

[17]  Stefan Kahrs.  Polymorphic Type Checking by Interpretation of Code , 1992 .

[18]  Thomas Noll,et al.  Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information , 2006, Acta Informatica.

[19]  C. Lewerentz,et al.  Integrated Project Team Management in a Software Development Environment , 1988 .

[20]  Didier Caucal,et al.  On infinite transition graphs having a decidable monadic theory , 1996, Theor. Comput. Sci..

[21]  Manfred Nagl,et al.  On Integration Mechanisms within a Graph-based Software Development Environment , 1987, WG.

[22]  Stefan Gruner.  Einige Anmerkungen zur graphgrammatischen Spezifikation von Integrationswerkzeugen nach Westfechtel, Janning, Lefering und Schürr , 1998 .

[23]  Manfred A. Jeusfeld,et al.  An Executable Meta Model for Re-Engineering of Database Schemas , 1994, Int. J. Cooperative Inf. Syst..

[24]  Werner Hans,et al.  Full Indexing for Lazy Narrowing , 1993 .

[25]  Patrick Shicheng Chen,et al.  On Inference Rules of Logic-Based Information Retrieval Systems , 1994, Inf. Process. Manag..

[26]  Stackbased ReductionGuido Hogen,et al.  Parallel Functional Implementations: Graphbased vs. Stackbased Reduction , 1995 .

[27]  M. O. Berger,et al.  k-coloring vertices using a neural network with convergence to valid solutions , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[28]  Gottfried Vossen,et al.  SUXESS: Towards a Sound Unification of Extensions of the Relational Data Model , 1991, Data Knowl. Eng..

[29]  Achim Blumensath.  Prefix-Recognisable Graphs and Monadic Second-Order Logic , 2001 .

[30]  Janis A. Bubenko,et al.  Requirements Engineering: An Integrated View of Representation, Process, and Domain , 1993, ESEC.

[31]  K. Jacobs.  OSI-an appropriate basis for group communication? , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[32]  Matthias Jarke,et al.  ConceptBase - A Deductive Object Base Manager , 1994 .

[33]  Zinaida Benenson,et al.  Tampering with Motes: Real-World Physical Attacks on Wireless Sensor Networks , 2006, SPC.

[34]  Vince Bárány.  Invariants of Automatic Presentations and Semi-synchronous Transductions , 2006, STACS.

[35]  George Horatiu Botorog.  High level parallel programming and the efficient implementation of numerical algorithms , 1998 .

[36]  Bernhard Steffen,et al.  Compositional Minimization of Finite State Systems , 1990, CAV.

[37]  Bruno Courcelle,et al.  Vertex-minors, monadic second-order logic, and a conjecture by Seese , 2007, J. Comb. Theory, Ser. B.

[38]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[39]  Markus Lohrey,et al.  On the Theory of One-Step Rewriting in Trace Monoids , 2002, ICALP.

[40]  Detlef Seese,et al.  The Structure of Models of Decidable Monadic Theories of Graphs , 1991, Ann. Pure Appl. Log..

[41]  Roland Baumann.  Client / Server Distribution in a Structure-Oriented Database Management System , 1997 .

[42]  Felix C. Freiling,et al.  Efficient Reductions for Wait-Free Termination Detection in Faulty Distributed Systems , 2005 .

[43]  Benedikt Bollig,et al.  Message-passing automata are expressively equivalent to EMSO logic , 2006, Theor. Comput. Sci..

[44]  Jürgen Giesl,et al.  Proving and Disproving Termination of Higher-Order Functions , 2005, FroCoS.

[45]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[46]  Matthias Jarke,et al.  From Relational to Object-Oriented Integrity Simplification , 1991, DOOD.

[47]  André Nies,et al.  Automatic structures: richness and limitations , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[48]  Andreas J. Winter,et al.  Modules and Updatable Graph Views for PROgrammed Graph REwriting Systems , 1997 .

[49]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[50]  P. Rossmanith,et al.  A New Satisabilit y Algorithm With Applications To Max-Cut , 2005 .

[51]  Otto Spaniol,et al.  File transfer in high-speed token ring networks: performance evaluation by approximate analysis and simulation , 1988, IEEE J. Sel. Areas Commun..

[52]  Thomas Colcombet.  On Families of Graphs Having a Decidable First Order Theory with Reachability , 2002, ICALP.

[53]  Arnaud Carayol,et al.  The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata , 2003, FSTTCS.

[54]  Werner Damm,et al.  Specifying distributed computer architectures in AADL , 1989, Parallel Comput..

[55]  Matthias Jarke,et al.  Simulating the Impact of Information Flows in Networked Organizations , 1996, ICIS.

[56]  Werner Hans,et al.  A Complete Indexing Scheme for WAM-based Abstract Machines , 1992, PLILP.

[57]  Johann A. Makowsky,et al.  On the Clique-Width of Graphs with Few P4's , 1999, Int. J. Found. Comput. Sci..

[58]  Felix C. Freiling,et al.  An offensive approach to teaching information security : 'Aachen summer school applied IT security , 2005 .

[59]  Ludwig Staiger,et al.  On Syntactic Congruences for Omega-Languages , 1993, Theor. Comput. Sci..

[60]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[61]  U. Quernheim.  Satellite communication protocols-a performance comparison considering on-board processing , 1988, 8th European Conference on Electrotechnics, Conference Proceedings on Area Communication.

[62]  Matthias Jarke,et al.  Exploring the Semantic Structure of Technical Document Collections: A Cooperative Systems Approach , 2000, CoopIS.

[63]  Albert Zündorf.  A Heuristic for the Subgraph Isomorphism Problem in Executing PROGRES , 1993 .

[64]  Frank Stephan,et al.  Definability and Regularity in Automatic Structures , 2004, STACS.

[65]  S. Gruner.  Fine-grained and Structure-Oriented Document Integration Tools are Needed for Development Processes , 2007 .

[66]  Bernhard Steffen,et al.  Generating Data Flow Analysis Algorithms from Modal Specifications , 1993, Sci. Comput. Program..

[67]  Guido Moerkotte,et al.  Nested Queries in Object Bases , 1993, DBPL.

[68]  Matthias Jarke,et al.  Three Aspects of Intelligent Cooperation in the Quality Cycle , 1993, Int. J. Cooperative Inf. Syst..

[69]  Rita Loogen,et al.  Dynamic Detection of Determinism in Functional Languages , 1991, Theor. Comput. Sci..

[70]  Markus Mohnen,et al.  Optimising the memory management of higher order functional programs , 1997 .

[71]  Andy Schürr,et al.  Specification of Graph Translators with Triple Graph Grammars , 1994, WG.

[72]  Alexandre Tessier.  Declarative Debugging in Constraint Logic Programming , 1996, ASIAN.

[73]  Rudolf Mathar,et al.  Analyzing routing strategy NFP in multihop packet radio networks on a line , 1995, IEEE Trans. Commun..

[74]  Olivier Carton,et al.  The Monadic Theory of Morphic Infinite Words and Generalizations , 2000, Inf. Comput..

[75]  Guido Moerkotte,et al.  Efficient Evaluation of Aggregates on Bulk Types , 1995, DBPL.

[76]  RWTHAachen,LehrstuhlfurInformatikII Ahornstrae55,W-5100Aachen,Germany , .

[77]  Felix C. Freiling,et al.  Revisiting Failure Detection and Consensus in Omission Failure Environments , 2005, ICTAC.

[78]  Uwe Naumann,et al.  Tangent-Linear Models by Augmented LL-Parsers , 2006, ICCSA.

[79]  Stefan Gruner.  Schemakorrespondenzaxiome unterstützen die paargrammatische Spezifikation inkrementeller Integrationswerkzeuge , 1997 .

[80]  Peter Klein.  Designing Software with Modula–3 , 2007 .

[81]  Matthias Jarke,et al.  Business process oriented information management: conceptual models at work , 1995, COCS '95.

[82]  Christian Prehofer,et al.  Higher-order narrowing with definitional trees , 1999, Journal of Functional Programming.

[83]  J. J. Ruzz,et al.  A VHDL Speci cation of a Shared Memory Parallel Machine for Babel , 1998 .

[84]  Martin Lefering.  Development of Incremental Integration Tools Using Formal Specifications , 1994 .

[85]  Markus Mohnen.  Efficient Compile-Time Garbage Collection for Arbitrary Data Structures , 1995, PLILP.

[86]  Martin Grohe,et al.  An existential locality theorem , 2004, Ann. Pure Appl. Log..

[87]  Thierry Cachat.  The Power of One-Letter Rational Languages , 2001, Developments in Language Theory.

[88]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[89]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

[90]  Felix C. Freiling,et al.  Optimal Randomized Fair Exchange with Secret Shared Coins , 2005, OPODIS.

[91]  Thomas Noll,et al.  Optimization of Straight-Line Code Revisited , 2006, Softwaretechnik-Trends.

[92]  Manfred A. Jeusfeld,et al.  Query Optimization in Deductive Object Bases , 1991, Query Processing for Advanced Database Systems, Dagstuhl.

[93]  Victor Ok Li.  PERFORMANCE MODELS OF DISTRIBUTED DATABASES. , 1981 .

[94]  U. Naumann,et al.  Toward Low Static Memory Jacobian Accumulation , 2006 .

[95]  Bernhard Steffen,et al.  Characteristic Formulae for Processes with Divergence , 1994, Inf. Comput..

[96]  U. Naumann,et al.  Intraprocedural Adjoint Code Generated by the Differentiation-Enabled NAGWare Fortran Compiler , 2006 .

[97]  U. Naumann.  Syntax-Directed Derivative Code (Part II: Intraprocedural Adjoint Code) , 2005 .

[98]  Berthold Vöcking,et al.  Decision-making based on approximate and smoothed Pareto curves , 2007, Theor. Comput. Sci..

[99]  Matthias Jarke,et al.  Intelligent Networks as a Data Intensive Application (INDIA) , 1994, ADB.

[100]  David E. Muller,et al.  The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[101]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[102]  Bruno Courcelle,et al.  Clique-width of countable graphs: a compactness property , 2000, Electron. Notes Discret. Math..

[103]  Andy Schürr.  PROGRESS: A VHL-Language Based on Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[104]  Rudolf Mathar,et al.  Analyzing a distributed slot assignment protocol by Markov chains , 1992, [1992 Proceedings] Vehicular Technology Society 42nd VTS Conference - Frontiers of Technology.

[105]  Matthias Jarke,et al.  Incremental Maintenance of Externally Materialized Views , 1996, VLDB.

[106]  Achim Blumensath,et al.  Finite Presentations of Infinite Structures: Automata and Interpretations , 2004, Theory of Computing Systems.

[107]  Andy Schürr,et al.  PROGRES , A Visual Language and Environment for PROgramming with Graph REwriting Systems 1 , 1994 .

[108]  Wolfgang Thomas,et al.  AMORE: A System for Computing Automata, MOnoids, and Regular Expressions , 1989, STACS.

[109]  Stefan Richter,et al.  A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.