[DMANET] Registration (virtual event): Reachability Problems RP 2021

Dear Colleagues,

Reachability Problems 2021 will be organised 25-27 October 2021
as a virtual event. Attendance to the virtual conference is free,
but registration is mandatory. Please fill the following form
before October 15, 2021. https://rp2021.csc.liv.ac.uk/registration.html

---------------------------------------------------------------------------------
The 15th International Conference on Reachability Problems (RP'21)
OCTOBER 25-27 2021, LIVERPOOL, UK
http://rp2021.csc.liv.ac.uk/

FREE REGISTRATION : October 15, 2021.
-- sponsored by London Mathematical Society and LNCS Springer --

The 15th International Conference on Reachability Problems (RP'21)
is being organised by the University of Liverpool and Liverpool John Moores University.

INVITED SPEAKERS:
- Udi Boker, IDC, Herzliya, Israel
- Clare Dixon, Manchester University, UK
- Javier Esparza, Technical University of Munich, Germany
- Damien Woods, Maynooth University Hamilton Institute, Ireland.
- Georg Zetzsche, Max Planck Institute for Software Systems, Kaiserslautern, Germany.

Papers presenting original contributions related to a wide spectrum
reachability questions in different computational models and systems
are being sought. This will also be the occasion to review recent
breakthroughs by renowned invited experts and survey emerging trends
and emphasise on key open challenges. Participants are kindly encouraged
to discuss core scientific issues that need to be further tackled.

PROGRAM. All times are in Europe/London (UTC+1).
-------------------------------
MONDAY, OCTOBER 25
Session 1
12:00–12:10: Welcome
12:10–13:10: Javier Esparza. Population Protocols: Beyond Runtime Analysis

Session 2
13:40–14:05: Alexander Bilgram, Peter Gjøl Jensen, Thomas Pedersen, Jiri Srba and Peter H. Taankvist. Improvements in Unfolding of Colored Petri Nets.
14:05–14:30: Joseph Livesey and Dominik Wojtczak. Minimal Number of Calls in Propositional Protocols.
14:30–14:55: Eric Allender, Archit Chauhan and Samir Datta Depth-First Search in Directed Planar Graphs, Revisited.

Session 3
15:10–15:35: Guillaume Girol, Benjamin Farinier and Sebastien Bardin. Not All Bugs Are Created Equal, But Robust Reachability Can Tell the Difference.
15:35–16:00: Sebastian Junges, Hazem Torfah and Sanjit A. Seshia. Runtime Monitoring for Markov Decision Processes.

Session 4
16:20–16:45: Joel Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea and Stefan Siemer. The Edit Distance to k-Subsequence Universality.
16:45–17:10: Maria Kosche, Tore Koß, Florin Manea and Stefan Siemer. Absent Subsequences in Words.
17:10–17:35: Pawel Gawrychowski, Florin Manea and Stefan Siemer. Matching Patterns with Variables under Hamming Distance.

-------------------------------
TUESDAY, OCTOBER 26
Session 5
13:00–14:00: Clare Dixon. Theorem Proving Using Clausal Resolution: From Past to Present.

Session 6
14:15–14:40: Quentin Peyras, Jean-Paul Bodeveix, Julien Brunel and David Chemouil. Sound Verification Procedures for Temporal Properties of Infinite-State Systems.
14:40–15:05: Stefan Kiefer, Pavel Semukhin and Cas Widdershoven. Linear-Time Model Checking Branching Processes.
15:05–15:30: Marcelo Forets and Christian Schilling. Reachability of weakly nonlinear systems using Carleman linearization.

Session 7
15:45–16:45: Damien Woods. Algorithmic Self-Assembly and Molecular Robotics: Theory and Practice.

Session 8
17:00–17:25: Marco Sälzer and Martin Lange. Reachability Is NP-Complete Even for the Simplest Neural Networks.
17:25–17:50: Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt and Guillermo Perez. Continuous One-Counter Automata.

-------------------------------
WEDNESDAY, OCTOBER 27

Session 9
13:00–14:00: Udi Boker. Quantitative vs. Weighted Automata.

Session 10
14:15–14:40: Oleg Karpenkov. Continued Fraction approach to Gauss-Reduction theory.
14:40–15:05: Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joel Ouaknine, Mahmoud Salamati, Sadegh Soudjani and James Worrell. The Pseudo-Skolem Problem is Decidable.
15:05–15:30: Ville Salo. Solitaire of independence.

Session 11
16:00–17:00: Georg Zetzsche. Recent Advances on Reachability Problems for Valence Systems.

-------------------------------

CONFERENCE CHAIRS
Patrick Totzke, University of Liverpool - co-chair
Paul Bell, Liverpool John Moores University- co-chair

PROGRAM COMMITTEE
Shaull Almagor (U. Oxford, UK)
Christel Baier (TU Dresden, DE)
Srivathsan B (CMI, Chennai, IN)
Olivier Bournez (Ecole Polytechnique, FR)
Laura Ciobanu (Edinburgh, UK)
Lorenzo Clemente (U. Warsaw, Poland)
Thao Dang (CNRS, U.Grenoble, FR)
Rayna Dimitrova (CISPA Helmholtz Center for Information Security, DE)
Manfred Droste (U. Leipzig, DE)
Stefan Goeller (U. Kassel, DE)
Matthew Hague (Royal Holloway U. London, UK)
Mika Hirvensalo (U. Turku, FI)
Sang-Ki Ko (Kangwon Natl. U., KR)
Florin Manea (Gottingen, DE)
Filip Mazowiecki (MPI Saarbruecken, DE)
Anca Muscholl, (U. Bordeaux, FR)
Igor Potapov, (U. of Liverpool, UK)
Maria Prandini (U.Milan, IT)
Krishna S (IIT, Bombei, IN)
Gregoire Sutre (U. Bordeaux, FR)
Pavel Semukhin (U. Oxford, UK)

ORGANISING COMMITTEE
Patrick Totzke, University of Liverpool
Paul Bell, Liverpool John Moores University
Igor Potapov, University of Liverpool

STEERING COMMITTEE
Parosh Aziz Abdulla (SE)
Olivier Bournez (FR)
Vesa Halava (FI)
Alain Finkel (FR)
Oscar Ibarra (USA)
Juhani Karhumaki (FI)
Jerome Leroux (FR)
Joel Ouaknine (DE)
Igor Potapov (UK)
James Worrell (UK)

As usual the RP conference proceeding will be published by LNCS, Springer.
https://dblp.org/db/conf/rp/index.html.

Apart from LNCS proceedings selected papers will be invited
to the special issue a respected journal similar to the past events:

RP 2019 - Journal of Computer and System Sciences
https://www.sciencedirect.com/journal/journal-of-computer-and-system-sciences/special-issue/10FZQBP14VF
RP 2017 - Fundamenta Informaticae, Volume 178(1-2)
https://content.iospress.com/journals/fundamenta-informaticae/178/1-2
RP 2016 - Theoretical Computer Science, Volume 750
https://www.sciencedirect.com/journal/theoretical-computer-science/vol/735/suppl/C
RP 2015 - Information and Computation, Volume277
https://www.sciencedirect.com/journal/information-and-computation/vol/277/suppl/C
RP 2014 - Theoretical Computer Science, Volume 735
https://www.sciencedirect.com/journal/theoretical-computer-science/vol/735/suppl/C
RP 2013 - Fundamenta Informaticae, Volume 143(3-4)
https://content.iospress.com/journals/fundamenta-informaticae/143/3-4


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************