• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
1
0
0

Texte intégral

(1)

Foreword

This Special Issue ofRAIRO, Theoretical Informatics and Applicationsis devoted to full versions of selected papers from the workshop Fixed Points in Computer Science 2002 (FICS’02), which was the fourth workshop in the FICS series.

Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks. The aim of the FICS workshop series is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the fixed point operation in the different fields and formalisms.

The workshop FICS’02, a satellite event of LICS’02, was held in Copenhagen on July 20 and 21, 2002. Previous workshops were held in Brno (1998, MFCS’98 workshop), Paris (2000, LC’2000 workshop) and Florence (2001, PLI’01 workshop).

The meeting was sponsored by SNF (Danish Natural Science Research Council), Otto Mønsteds Fond, BRICS (Basic Research in Computer Science) and the Department of Computer Science, Aalborg University. We thank our sponsors for making such a stimulating scientific event possible.

The topic of each talk was related to fixed points, including the construction and reasoning about properties of fixed points, categorical, metric and ordered fixed point models, fixed points in process algebras and process calculi, regular algebras of finitary and infinitary languages, infinite trees, theµ-calculus and other programming logics, fixed points and the lambda calculus, and others.

The scientific program of the workshop consisted of invited lectures given by Luca Aceto, Dexter Kozen, Anna Labella and Glynn Winskel, as well as presentations of 13 contributed papers selected by the Program Committee from a total of 18 submissions.

The Program Committee consisted of

J. Adamek (Braunschweig) I. Guessarian (Paris)

R. Backhouse (Nottingham) A. Ing´olfsd´ottir (Aalborg, cochair) S. Bloom (Hoboken, NJ) W. Kuich (Vienna)

J. Bradfield (Edinburgh) A. Labella (Rome) R. De Nicola (Florence) M. Mislove (Tulane) Z. ´Esik (Szeged, cochair) D. Niwinski (Warsaw).

This special issue contains the full text of five of the papers presented at the work- shop. We would like to thank everybody who contributed to the success of the meeting including invited speakers, members of the Program Committee, the authors of the con- tributed papers and all referees who assisted the Program Committee and the editors of this special issue.

ZOLTAN´ E´SIK(Szeged, Hungary) ANNAINGOLFSD´ OTTIR´ (Aalborg, Denmark) Special Issue Editors

Références

Documents relatifs

The main property that was shown and exploited was the “sepa- rability” or product form nature of the stationary solution when the service times are exponential and customers move

– Mahboubi, Melquiond, and Sibut-Pinote propose an efficient method for computing and proving bounds on certain definite integrals inside the Coq proof assistant. They extend

Selected and revised papers from the Ninth International Conference on Deontic Logic in Computer Science (DEON 2008).. The International Conference on Deontic Logic in Computer

This Special Issue of RAIRO, Theoretical Informatics and Applications is de- voted to full versions of selected papers from the workshop Word Avoidability, Complexity and

All carried out an excellent job dur- ing this demanding process: Erika Abraham (RWTH Aachen University, Ger- many), Farhad Arbab (CWI and Leiden University, The Netherlands),

Be- sides the authors of the papers, we would like to thank the members of the Program Committee of the workshop: Farhad Arbab (CWI, The Netherlands), Luis Barbosa (University of

All carried out an ex- cellent job during this demanding process: Stefan Blom (University of Twente, The Netherlands), Laura Brand´ an Briones (National University of

A current focal issue in computational complexity is the study of size and depth of Boolean circuits computing the majority function or a nested majority function.. The