Lecture Notes in Computer Science 6227

Transcription

1 Lecture Notes in Computer Science 6227 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany

2 Antonín Kučera (Eds.) Reachability Problems 4th International Workshop, RP 2010 Brno, Czech Republic, August 28-29, 2010 Proceedings 13

3 Volume Editors Antonín Kučera Masaryk University, Faculty of Informatics Botanická 68a, Brno, Czech Republic University of Liverpool, Department of Computer Science Ashton Building, Liverpool L69 3BX, England Library of Congress Control Number: CR Subject Classification (1998): F.3, D.2, D.3, F.4, F.4.1, F.1 LNCS Sublibrary: SL 1 Theoretical Computer Science and General Issues ISSN ISBN Springer Berlin Heidelberg New York ISBN Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. springer.com Springer-Verlag Berlin Heidelberg 2010 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper 06/3180

4 Preface This volume contains the papers presented at the 4th International Workshop on Reachability Problems, RP 2010 held during August 28 29, 2010 in the Faculty of Informatics, Masaryk University, Brno, Czech Republic and co-located with Joint MFCS and CSL 2010 (35th International Symposiums on Mathematical Foundations of Computer Science and 19th EACSL Annual Conferences on Computer Science Logic). RP 2010 was the fourth in the series of workshops following three successful meetings at Ecole Polytechnique, France in 2009 at University of Liverpool, UK in 2008 and at Turku University, Finland in The Reachability Problems workshops series aims at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in algebraic structures, computational models, hybrid systems, logic and verification, etc. Reachability is a fundamental problem in the context of many models and abstractions which describe various computational processes. Analysis of the computational traces and predictability questions for such models can be formalized as a set of different reachability problems. In general, reachability can be formulated as follows: Given a computational system with a set of allowed transformations (functions), decide whether a certain state of a system is reachable from a given initial state by a set of allowed transformations. The same questions can be asked not only about reachability of exact states of the system but also about a set of states expressed in terms of some property as a parameterized reachability problem. Another set of predictability questions can be seen in terms of reachability of eligible traces of computations, unavoidability of some dynamics and a possibility to avoid undesirable dynamics using a limited control. The purpose of the conference is to promote exploration of new approaches for the predictability of computational processes by merging mathematical, algorithmic and computational techniques. Topics of interest include (but are not limited to): reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter/ timed/ cellular/ communicating automata; Petri nets; computational aspects of algebraic structures (semigroups, groups and rings); frontiers between decidable and undecidable reachability problems; predictability in iterative maps and new computational paradigms. The first venue of Reachability Problems was Turku, Finland in 2007, as a satellite event of Developments in Language Theory DLT The second was held at Liverpool University in 2008 and the third at Ecole Polytechnique, France in 2009.

5 VI Preface The proceedings of the previous RP workshops appeared as follows: Mika Hirvensalo, Vesa Halava,, Jarkko Kari (Eds.): Proceedings of the Satellite Workshops of DLT TUCS General Publication No 45, June ISBN: Vesa Halava and (Eds.): Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Electronic Notes in Theoretical Computer Science. Volume 223, Pages (26 December 2008). Olivier Bournez and (Eds.): Reachability Problems, Third International Workshop, RP 2009, Palaiseau, France, September 23 25, 2009, Lecture Notes in Computer Science, 5797, Springer The four keynote speakers at the 2010 conference were: Markus Holzer, Descriptional Complexity of (Un)ambiguous Finite-State Machines and Pushdown Automata Kim Guldstrand Larsen, Symbolic and Compositional Reachability for Timed Automata Alexander Rabinovich, Temporal Logics over Linear Time Domains Are in PSPACE Philippe Schnoebelen, Lossy Counter Machines Decidability Cheat Sheet Each of the submitted papers received at least three reviews by members of the Program Committee, with the help of external reviewers. The full list of the 23 members of the Program Committee and the list of external reviewers can be found on the next two pages. The Program Committee is grateful for the highly appreciated and high-quality work produced by these external reviewers. Based on these reviews, the Program Committee decided finally to accept nine papers, in addition to the four invited talks. We also gratefully acknowledge the support from the Czech National Research Center Institute for Theoretical Computer Science (ITI). It is also a great pleasure to acknowledge the team of the EasyChair system, and the fine cooperation with the Lecture Notes in Computer Science team of Springer which made possible the production of this volume in time for the conference. Finally, we thank all the authors for the high quality of their contributions, and the participants for making this edition of RP 2010 a success. June 2010 Antonín Kučera

6 Conference Organization Program Chairs Antonín Kučera Program Committee Parosh Aziz Abdulla Eugene Asarin Christel Baier Bernard Boigelot Olivier Bournez Cristian S. Calude Stephane Demri Javier Esparza Laurent Fribourg Vesa Halava Oscar Ibarra Franjo Ivancic Juhani Karhumäki Joost-Pieter Katoen Antonin Kucera Michal Kunc Alexander Kurz Slawomir Lasota Alexei Lisitsa Luke Ong Wolfgang Thomas Hsu-Chun Yen Uppsala, Sweden Paris, France Bonn, Germany Liege, Belgium Palaiseau, France Auckland, New Zealand Cachan, France München, Germany Cachan, France Turku, Finland Santa Barbara, USA Princeton, USA Turku, Finland Aachen, Germany Brno, Czech Republic Brno, Czech Republic Leicester, UK Warsaw, Poland Liverpool, UK Oxford, UK Liverpool, UK Aachen, Germany Taipei, Taiwan, China Local Organization Antonín Kučera with the help offered by the Faculty of Informatics, Masaryk University for the organization of the Reachability Workshop.

7 VIII Conference Organization External Reviewers Laurent Doyen Ingo Felscher Florent Jacquemard Arnaud Sangnier Pawel Parys David Pichardie Roman Rabinovich

8 Table of Contents Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata (Invited Talk)... 1 Markus Holzer and Martin Kutrib Symbolic and Compositional Reachability for Timed Automata (Invited Talk) Kim Guldstrand Larsen Temporal Logics over Linear Time Domains Are in PSPACE (Invited Talk) Alexander Rabinovich Lossy Counter Machines Decidability Cheat Sheet (Invited Talk) Philippe Schnoebelen Behavioral Cartography of Timed Automata Étienne André and Laurent Fribourg On the Joint Spectral Radius for Bounded Matrix Languages Paul C. Bell, Vesa Halava, and Mika Hirvensalo Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P Jakub Chaloupka Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata Maurice Margenstern Rewriting Systems for Reachability in Vector Addition Systems with Pairs Paulin Jacobé de Naurois and Virgile Mogbil The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions Martin Mundhenk and Felix Weiß Depth Boundedness in Multiset Rewriting Systems with Name Binding Fernando Rosa-Velardo

9 X Table of Contents Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA Zdeněk Sawa Efficient Graph Reachability Query Answering Using Tree Decomposition Fang Wei Author Index