Series Editors
Gerhard Goos, Karlsruhe University, Germany
Juris Hartmanis, Cornell University, NY, USA
Jan van Leeuwen, Utrecht University, The Netherlands
Volume Editors
Wojciech Penczek
Polish Academy of Sciences, Institute of Computer Sciences
ul. Ordona 21, 01-237 Warsaw, Poland
Andrzej Szalas
University of Warsaw, Institute of Informatics
ul. Banacha 2, 02-097 Warsaw, Poland
Cataloging-in-Publication data applied for
Die Deutsche Bibliothek - CIP-Einheitsaufnahme
Mathematical foundations of computer science 1996 : 21th international symposium ; proceedings / MFCS '96, Craków, Poland, September 2 - 6, 1996 / Wojciech Penczek ; Andrzej Szałas (ed.). - Berlin ; Heidelberg ; New York ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Santa Clara ; Singapore ; Tokyo : Springer, 1996
(Lecture notes in computer science ; Vol. 1113)
ISBN 3-540-61550-4
NE: Penczek, Wojciech [Hrsg.]; MFCS <21, 1996, Kraków>; GT
CR Subject Classification (1991): E1-4, D.2-3, G. 2
ISSN 0302-9743
ISBN 3-540-61550-4 Springer-Verlag 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-Verlag. Violations are liable for prosecution under the German Copyright Law.
© Springer-Verlag Berlin Heidelberg 1996
Printed in Germany
Typesetting: Camera-ready by author
SPIN 10513314 06/3142-543210 Printed on acid-free paper
Foreword
The present volume contains the papers selected for presentation at the 21st Symposium on Mathematical Foundations of Computer Science (MFCS’96) held in Cracow, Poland, September 2-6, 1996. The symposium was organized in the Polonia Institute of the Jagiellonian University.
It was the 21st symposium in a series of international meetings organized alternately in the Czech Republic, Poland, and the Slovak Republic. The aim of these symposia is to bring together specialists in various theoretical fields of computer science and to stimulate mathematical research in all branches of theoretical computer science. The previous meetings took place in Jabłonna, 1972; Štrbské Pleso, 1973; Jadwisin, 1974; Mariánské Lázně, 1975; Gdańsk, 1976; Tatranská Lomnica, 1977; Zakopane, 1978; Olomouc, 1979; Rydzyna, 1980; Štrbské Pleso, 1981; Prague, 1984; Bratislava, 1986; Carlsbad, 1988; PorąbkaKozubnik, 1989; Banská Bystrica, 1990; Kazimierz Dolny, 1991; Prague, 1992; Gdańsk, 1993; Košice, 1994; and Prague, 1995.
The program committee of MFCS’96 consisted of:
K.R. Apt (The Netherlands) |
W. Marek (USA) |
R. Back (Finland) |
I. Németi (Hungary) |
J.C.M. Baeten (The Netherlands) |
R. De Nicola (Italy) |
M. Crochemore (France) |
M. Nielsen (Denmark) |
D. Gabbay (UK) |
E. R. Olderog (Germany) |
M.C. Gaudel (France) |
E. Orłowska (Poland) |
U. Goltz (Germany) |
Z. Pawlak (Poland) |
W. Foryś (Poland) |
W. Penczek (chair, Poland) |
R. Kurshan (USA) |
A. Pnueli (Israel) |
G. Rozenberg (The Netherlands) |
A. Szalas (co-chair, Poland) |
P. Ružička (Slovak Republik) |
A. Tarlecki (Poland) |
W. Rytter (Poland) |
I. Wegener (Germany) |
C. Stirling (UK) |
J. Zlatuška (Czech Republic) |
The scientific program included invited lectures covering the areas of main interest and contributed papers. Altogether 35 contributed papers were selected out of 92 submissions. Thus the present volume contains 35 contributed papers, 8 invited papers, and 2 abstracts of the invited talks.
The selection process was organized in a distributed way via e-mail discussions. It took over one month to select the papers. This allowed Program Committee members to carefully discuss the evaluation of the submitted papers.
The following referees assisted the Program Committee in the extensive evaluation process: L. Aceto, S. Ambroszkiewicz, D. Ancona, R. Back, E. Bampis, T. Basten, M.A. Bednarczyk, J. Berstel, J. Blanco, R. Bloo, F. de Boer, J. Bohn,
M. Boreale, O. J. Boxma, T. Brauner, F. van Breugel, H. Buhrman, G. Castagna, J. Cassaigne, A. Cheng, B. Chlebus, P. Chrétienne, V. Dancik, S. Delaet, S. Demri, J. Desarmenien, H. Dierks, M. Dietzfelbinger, K. Diks, K. Doets, P. Duris, P. van Emde Boas, U. H. Engberg, E. Fachini, M. Fernandez, G. Ferrari, C. Fischer, P. Fischer, H. Fleischhack, W. Fokkink, L.C. van der Gaag, L. Gąsieniec, F. Gécseg, H. Geuvers, P. Godefroid, J. Goldsmith, B. Grahlmann, B. Graves, J. Grundy, A. Habel, J. Harrison, T. Hegedus, W. H. Hesselink, T. Hofmeister, M. Huhn, H. Huttel, M. Hühne, P. Idziak, W. Janssen, M. Jerrum, C. Johnen, B. Juurlink, S. Kahrs, L. Kari, M. Karpiński, C. Kenyon, J. Kleist, J. N. Kok, B. Konikowska, J.-C. König, M. Krause, H.-J. Kreowski, M. Kryszkiewicz, R. Kubiak, R. Kuiper, O. Kupferman, Á. Kurucz, A. Labella, K.G. Larsen, C. Lavault, J. van Leeuwen, H. Lefmann, C. Lynch, J. Madarász, A. Maggiolo-Schettini, M. Marchiori, A. Masini, A. Mateescu, G. Mirkowska, U. Montanari, M. Morvan, P. D. Mosses, J. Neraud, P. Niebert, D. Niwiński, E. Ochmański, D. Pardubska, G. Paun, W. Pawłowski, D.A. Peled, D. Perrin, A. Pierantonio, W. Plandowski, R. Pugliese, P. Quaglia, M. Raczunas, A. Ramer, M. Regnier, M.A. Reniers, A. Rensink, B. Reus, D. Revuz, G. Roussel, B. Rovan, J. Rutten, G. Sági, I. Sain, A. Salomaa, K. Salomaa, D. Sangiorgi, V. Sassone, M. Schenke, M. Schwartzbach, P. Seebold, D. Sieling, A. Simon, H. U. Simon, S. Sokołowski, N. Spyratos, M. Srebrny, P. Stevens, K. Sunesen, O. Sýkora, M. Ślusarek, R. Szelepcsenyi, A. Szepietowski, J.-Y. Thibon, J. Tiuryn, M. Truszczyński, P. Urzyczyn, J.J. Vereijken, L. Viennot, E. de Vink, I. Vrto, D. Walker, E. Waller, I. Walukiewicz, R. Wegner, H. Wehrheim, J. Winkowski, M. Wirsing, J. von Wright, S. Yu, M. Zawadowski, B. Zerrouk, W. Zielonka.
The Symposium was organized by the Institute of Computer Science of the Polish Academy of Sciences and the Institute of Informatics of Warsaw University. The Organizing Committee consisted of: S. Ambroszkiewicz, M. Białasik, W. Foryś, E. Gąsiorowska, B. Konikowska (chair), W. Penczek, M. Srebrny, A. Szalas, and A. Tarlecki.
The MFCS’96 Symposium was supported by the following institutions and companies: the European Association for Theoretical Computer Science, ICS PAS, Warsaw University, European MEDICIS project, Microsoft Poland, SUN Poland, the Batory Foundation, and the State Committee for Scientific Research (KBN).
We would like to thank the invited speakers, the authors of the papers, and the Program Committee members. We would also like to thank all the above institutions and companies for financial support. We are also indebted to Springer-Verlag for excellent co-operation in publishing this volume.
Contents
Invited Papers
Word level model checking
E.M. Clarke, X. Zhao … 1
Code problems on traces
V. Diekert, A. Muscholl … 2
Models of DNA computation
A. Gibbons, M. Amos, D. Hodgson … 18
Theory and practice of action semantics
P.D. Mosses … 37
Linear time temporal logics over Mazurkiewicz traces
M. Mukund, P.S. Thiagarajan … 62
Partial order reduction: model-checking using representatives
D.A. Peled … 93
Nonmonotonic rule systems: forward chaining, constraints, and complexity
J.B. Remmel … 113
Mind the gap! Abstract versus concrete models of specifications
D. Sannella, A. Tarlecki … 114
A sequent calculus for subtyping polymorphic types
J. Tiuryn … 135
Kolmogorov complexity: recent research in Moscow
V.A. Uspensky … 156
Contributed Papers
A modal logic for data analysis
P. Balbiani … 167
From specifications to programs: a fork-algebraic approach to bridge the gap
G. A. Baum, M.F. Frias, A.M. Haeberer, P.E. Martinez López … 180
Logic of predicates with explicit substitutions
M.A. Bednarczyk … 192
On the query complexity of sets
R. Beigel, W. Gasarch, M. Kummer, G. Martin, T. McNicholl, F. Stephan … 206
A lambda calculus of incomplete objects
V. Bono, M. Bugliesi, L. Liquori … 218
Bisimilarity problems requiring exponential time
M. Boreale, L. Trevisan … 230
Linear dynamic Kahn networks are deterministic
A. de Bruin, S.H. Nienhuys-Cheng … 242
Shortest path problems with time constraints
X. Cai, T. Kloks, C.K. Wong … 255
Parallel alternating-direction access machine
B. S. Chlebus, A. Czumaj, L. Gąsieniec,
M. Kowaluk, W. Plandowski … 267
Specification and verification of timed lazy systems
F. Corradini, M. Pistore … 279
A class of information logics with a decidable validity problem
S. Demri … 291
On the power of nonconservative PRAM
A. Dessmark, A. Lingas … 303
Self-similarity viewed as a local property via tile sets
B. Durand … 312
Simulation of specification statements in Hoare logic
K. Engelhardt, W.-P. de Roever … 324
Equational properties of iteration in algebraically complete categories
Z. Ésik, A. Labella … 336
On unconditional transfer
H. Fernau … 348
(poly(log logn), poly(log logn) )-restricted verifiers are unlikely to exist for languages in NP
D. Fotakis, P. Spirakis … 360
Minimizing congestion of layouts for ATM networks with faulty links
L. Gąsieniec, E. Kranakis, D. Krizanc, A. Pelc … 372
Polynomial automaticity, context-free languages, and fixed points of morphisms (extended abstract)
I. Glaister, J. Shallit … 382
Causal testing
U. Goltz, H. Wehrheim … 394
Construction of list homomorphisms by tupling and fusion
Z. Hu, H. Iwasaki, M. Takeichi … 407
Probabilistic metric semantics for a simple
language with recursion
M. Kwiatkowska, G. Norman … 419
Dynamic graphs
A. Maggiolo-Schettini, J. Winkowski … 431
Equations on trees
S. Mantaci, A. Restivo … 443
On the equivalence problem for E-pattern languages (extended abstract)
E. Ohlebusch, E. Ukkonen … 457
Specifying and verifying parametric processes
W. Pawlowski, P. Paczkowski, S. Sokolowski … 469
On saturation with flexible function symbols
R. Pliuškevičius … 482
Approximating good simultaneous diophantine approximations is almost NP-hard
C. Rössner, J.-P. Seifert … 494
On the conjugation of standard morphisms
P. Séébold … 506