2nd Workshop on Reachability Problems
September 15–17, 2008, Liverpool, UK
Programme of RP'2008 Workshop
The workshop takes place from Monday (15.09.08) 9.00 am till Wednesday 1.00 pm (17.09.08).
|
Monday, 15 September, 2008
|
|
|
8:30-9:25 |
Registration |
|
9:25-9:30 |
Workshop opening |
|
9:30-10:30 |
Invited Talk Reachability in the Infinite: Decidability and Limitations Wolfgang Thomas |
|
10:30-11:00 |
Coffee Break |
|
11:00-11:30 |
Falsifying Safety Properties Through Games on Over-approximating
Models. Nathaniel Charlton and Michael Huth. |
|
11:30-12:00 |
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear
Dynamical Systems. Pieter Collins and Goldsztejn Alexandre. |
|
12:00-12:30 |
Approximated Reachability on Hybrid Automata: Falsification meets
Certification. Kerstin Bauer, Raffaella Gentilini
and Klaus Schneider. |
|
12:30-14:00 |
Lunch |
|
14:00-14:30 |
Reachability in Petri Nets with Inhibitor arcs. Klaus Reinhardt. |
|
14:30-15:00 |
Dynamic Slicing Techniques for Petri Nets. Marisa Llorens, Javier Oliver, Josep Silva, Salvador Tamarit
and German Vidal |
|
15:00-15:30 |
Analyzing Reachability for Some Petri Nets with Fast Growing Markings. M. Praveen and Kamal Lodaya |
|
15:30-16:00 |
Coffee Break |
|
16:00-17:00 |
Invited Talk Monotonic Abstraction in Parameterized Verification Parosh Aziz Abdulla |
|
17:30 |
Excursion: Liverpool City Guided Sightseeing Coach Tour (meeting point: Ashton Building, ground floor at 17:20 ) |
|
Tuesday, 16 September, 2008
|
|
|
9:30-10:30 |
Invited Talk Reachability via Cooperating Morphisms Juhani Karhumäki |
|
10:30-11:00 |
Coffee Break |
|
11:00-11:30 |
Switching Graphs. Jan Friso Groote and Bas Ploeger. |
|
11:30-12:00 |
The Length of Subset Reachability in Nondeterministic Automata. Pavel Martyugin. |
|
12:00-12:30 |
A Universal Cellular Automaton on the Ternary Heptagrid.
Maurice Margenstern and Yu Song. |
|
12:30-14:00 |
Lunch |
|
14:00-14:30 |
The Compositional Method and Regular Reachability. Ingo Felscher. |
|
14:30-15:00 |
A new Algorithm for Partitioned Symbolic Reachability Analysis. Kai Lampka. |
|
15:00-15:30 |
Handling Left-Quadratic Rules When Completing Tree Automata. Yohan Boichut,
Romeo Courbis, Pierre-Cyrille
Heam and Olga Kouchnarenko. |
|
15:30-16:00 |
Coffee Break |
|
16:00-17:00 |
Invited Talk Dependency Tree Automata Colin Stirling |
|
19:00 |
Conference Dinner (60 Hope Street, Liverpool) |
|
Wednesday, 17 September, 2008
|
|
|
9:30-10:30 |
Tutorial on the Petri Net Reachability Problem (Informal
presentation) Kamal Lodaya |
|
10:30-11:00 |
Solving Coverability Problems by Supercompilation (Informal presentation) Alexei Lisitsa and Andrei Nemytykh |
|
11:00-11:15 |
Coffee Break |
|
11:15-11:45 |
The Complexity of Satisfiability for
Fragments of CTL and CTL*. Arne Meier, Martin Mundhenk |
|
11:45-12:15 |
An Inverse Method for Parametric Timed Automata. Etienne Andre, Fribourg Laurent, Thomas Chatain
and Emmanuelle Encrenaz |
|
12:15-13:30 |
Lunch |
|
13:30-19:00 |
Workshop
on Grand Challenges of Unconventional Computation Location: Seminar Room, Department of Physiology, University of Liverpool Organiser: Prof. Christian Calude. |
|
|
|
You are most welcome to attend the following events for free:
-
Workshop on Grand Challenges of Unconventional Computation
- Date: 17 September, 1:30 pm - 7:00 pm;
- Location: Seminar Room, Department of Physiology, University of Liverpool;
- Organiser: Prof. Christian Calude.
-
Interdisciplinary Symposium on Stochastic Networks and Internet Technology
- Date: 18 September, 9.30am-3.30pm;
- Location: Seminar Room, Department of Physiology, University of Liverpool;
- Organiser: Prof. Erol Gelenbe.