[TYPES/announce] CfP: WORKSHOP RP'2010

[Alexander Kurz]

 ================= Call for Papers =================

   4th WORKSHOP ON REACHABILITY PROBLEMS, RP'2010
(August 27-29, 2010, Masaryk University, Brno, Czech Republic)
           co-located with MFCS & CSL 2010
           http://www.csc.liv.ac.uk/~rp2010/

  ---------------------------------------------------
  Deadline for submissions is EXTENDED: May 11, 2010
  Proceedings will be published in the  Springer LNCS
  ---------------------------------------------------

The Workshop on Reachability Problems will be hosted
by the Faculty of Informatics, Masaryk University,
Brno, Czech Republic and co-located with
Joint MFCS and CSL 2010. RP'10 is 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 2007.

Scope: The Reachability Workshop is specifically
aimed 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


Invited Speakers:
=================
- Markus Holzer (Giessen University, Germany)
- Kim Guldstrand Larsen (Aalborg University, Denmark)
- Alexander Rabinovich (Tel Aviv University, Israel)
- Philippe Schnoebelen (ENS Cachan, France)


Important dates:
=================
Submission: May 11, 2010
Notification: June 3, 2010
Final version: June 10, 2010
Conference dates:  Aug. 27-29, 2010


Topics of interest:
======================
Papers presenting original contributions related to
reachability problems in different computational
models and systems are being sought.
Topics of interest include (but are not limited to):
Reachability for infinite state systems, rewriting
systems; Reachability analysis in counter/ timed/
cellular/ communicating automata; Petri-Nets;
computational aspects of semigroups, groups and
rings; Reachability in dynamical and hybrid systems;
frontiers between decidable and undecidable
reachability problems; complexity and decidability aspects;
predictability in iterative maps and new computational paradigms


The reachability problems are in the core of many
questions of computer science and mathematics.
This topic covers many aspects about the analysis of
computational traces/paths in classical and
unconventional computational models, logic,
algebraic structures as well as
in mathematical systems and control theory.
The classical reachability can be formulated as follows:
Given a computational system or model 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 term 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, their equivalence;
unavoidability of some dynamics and a possibility
to avoid undesirable dynamic using a limited control.


Proceedings
===========
The Conference Proceedings will be published
as the volume of the Springer Verlag
Lecture Notes in Computer Science (LNCS) series
www.springer.com/lncs and distributed at the Conference.
We plan also to publish selected papers in a special
issue of a high quality journal following the
regular referee procedure.


Submissions:
============
Authors are invited to submit a draft of a full paper
with at most 12 pages  (in LaTeX, formatted according
to LNCS guidelines) via the conference web page.
Proofs omitted due to space constraints must be put
into an appendix to be read by the program committee
members at their discretion.
Submissions deviating from these guidelines risk rejection.
Electronic submissions should be formatted in postscript
or pdf. Simultaneous submission to other conferences or
workshops with published proceedings is not allowed.


Program Committee:
==================
- Parosh Aziz Abdulla, Uppsala
- Eugene Asarin, Paris
- Christel Baier, Bonn
- Bernard Boigelot, Liege
- Olivier Bournez, Palaiseau
- Cristian S. Calude, Auckland
- Stephane Demri, Cachan
- Javier Esparza, Munich
- Laurent Fribourg, Cachan
- Vesa Halava, Turku
- Oscar Ibarra, Santa Barbara
- Franjo Ivancic, Princeton
- Juhani Karhumaki, Turku
- Joost-Pieter Katoen, Aachen
- Antonin Kucera, Brno
- Michal Kunc, Brno
- Alexander Kurz, Leicester
- Slawomir Lasota, Warsaw
- Alexei Lisitsa, Liverpool
- Luke Ong, Oxford
- Igor Potapov, Liverpool
- Wolfgang Thomas, Aachen
- Hsu-Chun Yen, Taipei


Organizing Committee:
=====================
- Antonin Kucera (Masaryk University)
- Igor Potapov (University of Liverpool)


Contact details:
RP'2010
Faculty of Informatics, Masaryk University,

Emails:
Antonin Kucera tony at fi.muni.cz
Igor Potapov  potapov at liverpool.ac.uk