4th Workshop on Reachability Problems

August 28–29, 2010, Brno , Czech Republic

Programme of RP'2010 Workshop

The workshop takes place from Saturday (28.08.10) 9.00 am till Sunday 16.00 pm (29.08.10).

 

Saturday, 28 August, 2010

 

8:30-9:25

Registration

9:25-9:30

Workshop opening

9:30-10:30

Invited Talk

Lossy Counter Machines Decidability Cheat Sheet

Philippe Schnoebelen

10:30-11:00

Coffee Break

11:00-11:30

Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P.

Jakub Chaloupka

11:30-12:00

Rewriting Systems for Reachability in Vector Addition Systems with Pairs.

Virgile Mogbil and Paulin Jacobe de Naurois

12:00-12:30 

On the Joint Spectral Radius for Bounded Matrix Languages.

Paul Bell, Vesa Halava and Mika Hirvensalo

12:30-14:00

Lunch

14:00-15:00

Invited Talk

Symbolic and Compositional Reachability for Timed Automata

Kim Guldstrand Larsen

15:00-15:30

Behavioral Cartography of Timed Automata.

Etienne Andre and Laurent Fribourg.

15:30-16:00

Efficient Graph Reachability Query Answering using Tree Decomposition.

Fang Wei

16:00-16:30

Coffee Break

16:30-17:00

(Informal presentation)

Spatial Properties of 3-Dimensional Piecewise Constant Derivative Systems.

Olga Tveretina, Simon Stroh and Carsten Sinz

17:30-18:00

(Informal presentation)

Verification of Hybrid Systems by Incremental Abstract Forward/Backward Computation.

Stefan Ratschan and Tomas Dzetkulic.

 

 

 

Sunday, 29 August, 2010

 

9:30-10:30

Invited Talk

Descriptional Complexity of (Un)ambiguous Finite-State Machines and Pushdown Automata.

Markus Holzer

10:30-11:00

Coffee Break

11:00-11:30

Towards the frontier between decidability and undecidability for hyperbolic cellular automata.

Maurice Margenstern

11:30-12:00

Efficient Construction of a Semilinear Representation of a Language Accepted by an Unary NFA.

Zdenek Sawa

12:00-14:00

Lunch

14:00-15:00

Invited Talk

Temporal Logics over Linear Time Domains Are in PSPACE

Alexander Rabinovich

15:00-15:30

The complexity of model checking for intuitionistic logics and their modal companions.

Martin Mundhenk and Felix Weiss

15:30-16:00

Depth boundedness in multiset rewriting systems with name binding.

Fernando Rosa-Velardo

16:00

Workshop closing