From Reachability Problems 2009

Main: HomePage


The annual fall colloquium organized by the computer science department of Ecole Polytechnique (LIX) will host Reachability Problems RP'2009.

Reachability Problems RP'2009 will take place at Ecole Polytechnique (on-site at Palaiseau, a suburb district of Paris).

Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.

This will also be the occasion to review recent breakthroughs by renown invited experts and survey emerging trends and emphasize on key open challenges. Participants are kindly encouraged to discuss on core scientific issues that need to be further tackled.


Reachability Problems is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in

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); predictability in iterative maps and new computational paradigms.


The proceedings of the conference will be published in the Springer Verlag LNCS series and distributed during the conference.

They will appear as volume 5797 of Lecture Notes in Computer Science.

Selected papers will be invited to the special issue of a high quality journal devoted to RP 2009.

Ecole Polytechnique

Virtual visit of the campus by means of panoramic images

Previous LIX Automn Colloquium

Previous LIX/Ecole Polytechnique autumn colloquium:

Previous Reachability Problems


Retrieved from
Page last modified on October 09, 2009, at 04:16 PM