[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]




The 5th Edition of the Reachability Problems Workshop
September 28 - 30, 2011
Genova, Italy
webpage: http://rp11.disi.unige.it/


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.

Topics of interest include: 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.

Previous RP editions took place in Brno (Czech Republic, 2010),
Palaiseau (France, 2009), Liverpool (UK, 2008),
Turku (Finland, 2007).

The fifth edition will be held in Genova, a historic city in Liguria, 


Krishnendu Chatterjee, IST Austria
Graph Games with Reachability Objectives: Mixing Chess, Soccer and Poker

Bruno Courcelle, Labri, Universitè Bordeaux 1
Automata for monadic second-order model-checking

Joost-Pieter Katoen, RWTH Aachen
Timed Automata as Observers of Stochastic Processes

Jean-Francois Raskin, CFV, Universitè Libre de Bruxelles
Reachability Problems for Hybrid Automata


Monotonic Abstraction for Programs with Multiply Pointed Structures
Jonathan Cederberg, Parosh Abdulla and Tomas Vojnar

A new weakly universal cellular automaton in the 3D hyperbolic space
with two states
Maurice Margenstern

Reachability for Finite-State Process Algebras Using Static Analysis
Nataliya Skrypnyuk and Flemming Nielson

A fully symbolic bisimulation algorithm
Malcolm Mumme and Gianfranco Ciardo

Lower bounds for the length of reset words in eulerian automata
Vladimir Gusev

Automated Termination in Model Checking Modulo Theories
Alessandro Carioni, Silvio Ghilardi and Silvio Ranise

Parametric Verification and Test Coverage for Hybrid Automata Using the
Inverse Method
Fribourg Laurent and Ulrich Kuehne

Characterizing Conclusive Approximations by Logical Formulae
Yohan Boichut, Thi-Bich-Hanh Dao and Valerie Murat.

Synthesis of Timing Parameters Satisfying Safety Properties
Etienne Andre' and Romain Soulat

Decidability of LTL Model Checking for Vector Addition Systems with one
Remi Bonnet

Completeness of the Bounded Satisfiability Problem for Constraint LTL
Marcello M. Bersani, Achille Frigeri, Matteo Rossi and Pierluigi San Pietro

Reachability and deadlocking problems in multi-stage scheduling
Christian Eggermont and Gerhard J. Woeginger

Improving Reachability Analysis of Infinite State Systems by Specialization
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti and Valerio Senni

Formal Language Constrained Reachability and Model Checking
Propositional Dynamic Logics
Roland Axelsson and Martin Lange

Complexity Analysis of the Backward Coverability Algorithm for VASS
Laura Bozzelli and Pierre Ganty

Efficient Bounded Reachability Computation for Rectangular Automata
Xin Chen, Erika Abraham and Goran Frehse

The preliminary program is available at the RP webpage


The early registration deadline is 31st of July.

Early (until July 31)
Regular fee    200    250
Student fee    150    200

Late (after July 31): +50


September is a very busy period in Genova (there are several other
conferences and events right before and after RP). We have an option for
a limited number of rooms in the hotels in the city center.  Our
University can also offer (a limited number of) accomodations in Casa
Paganini (student residence) at very convenient prices.
Travel information and on-line registration/booking forms are available
under the RP webpage:


For further information, please contact the RP 2011 organizers:

Giorgio Delzanno: delzanno@disi.unige.it
Igor Potapov: potapov@liverpool.ac.uk