CALL FOR PARTICIPATION
RP 2019
13th International Conference on Reachability Problems
SEPTEMBER 11-13 2019, BRUSSELS, BELGIUM
https://sites.uclouvain.be/rp2019/
=================================
AIMS AND OBJECTIVES
===================
The conference is specifically aimed at gathering together scholars from diverse disciplines
and backgrounds interested in reachability problems that appear in
● Algebraic structures
● Automata Theory and Formal Languages
● Computational Game Theory
● Concurrency and Distributed Computation
● Decision Procedures in Computational Models
● Hybrid Dynamical Systems
● Logic and Model Checking
● Verification of Finite and Infinite-State Systems
REGISTRATION
The registration is possible until September 06 2019:
students (260€) and non-students (290€) attendants.
PROGRAM
=======
The program consists of 5 invited talks, 14 presentations of regular LNCS papers
and 16 talks for presentation-only papers.
https://sites.uclouvain.be/rp2019/program.html
Invited Talks
===================
Thomas A. Henzinger, IST Austria.
[Temporal Logics for Multi-Agent Systems]
Vladimir Protasov, HSE Moscow.
[Primitivity and synchronizing automata: a functional analytic approach]
Slawomir Lasota, U. Warsaw.
[The Reachability Problem for Petri Nets is Not Elementary]
Sriram Sankaranarayanan, U. Colorado Boulder.
[Reaching out towards fully verified autonomous systems]
Jean-François Raskin, ULB Brussels.
[Game graphs for reactive synthesis]
Regular papers
===================
Partial Solvers for Generalized Parity Games
Véronique Bruyère, Guillermo Perez, Jean-Francois Raskin and Clément Tamines
Reachability of Five Gossip Protocols
Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis and Louwe B. Kuijer
On Relevant Equilibria in Reachability Games
Thomas Brihaye, Véronique Bruyère, Aline Goeminne and Nathan Thomasset
On the Computation of the Minimal Coverability Set of Petri Nets
Pierre-Alain Reynier and Frédéric Servais
On the Termination Problem for Counter Machines with Incrementing Errors
Christopher Hampson
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets
Sylvain Schmitz and Georg Zetzsche
Reachability Problems on Partially Lossy Queue Automata
Chris Köcher
Synthesis of Structurally Restricted b-Bounded Petri Nets: Complexity Results
Ronny Tredup
On the Decidability of Parameterised Verification in Pub/Sub Networks with or without Exception Handling
Giorgio Delzanno
Deciding Reachability for Piecewise Constant Derivative Systems on Manifolds
Andrei Sandler and Olga Tveretina
On the m-Eternal Domination Number of Cactus Graphs
Václav Blažej, Tomáš Valla and Jan Matyáš Křišťan
On Solving Word Equations Using SAT
Joel Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka and Danny Bøgsted Poulsen
Reachability in Augmented Interval Markov Chains
Ventsislav Chonev
Cellular Automata for the Self-Stabilisation of Colourings and Tilings
Nazim Fatès, Irène Marcovici and Siamak Taati
Presentation-only papers
===================
Synthesis of Data Word Transducers
Léo Exibard, Emmanuel Filiot and Pierre-Alain Reynier
Monadic Decomposability of Regular Relations
Pablo Barceló, Chih-Duo Hong, Xuan-Bach Le, Anthony Widjaja Lin and Reino Niskanen
State Complexity of the Multiples of the Thue-Morse Set
Emilie Charlier, Célia Cisternino and Adeline Massuir
The Complexity of Mean Payoff Games Using Universal Graphs
Pierre Ohlmann, Nathanaël Fijalkow and Paweł Gawrychowski
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
Stéphane Le Roux, Arno Pauly and Mickael Randour
Randomization and Quantization for Average Consensus
Bernadette Charron-Bost and Patrick Lambein-Monette
Path-Complete Reachability for Switching Systems
Nikolaos Athanasopoulos and Raphaël Jungers
Reachability in Stochastic Hybrid Systems
Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière and Pierre Vandenhove
On the Decidability of Reachability in Linear Time-Invariant Systems
Amaury Pouly, Nathanaël Fijalkow, James Worrell, Joel Ouaknine, Joao Sousa Pinto and Mohan Saiteja
Termination of Affine Loops over the Integers
Mehran Hosseini, Joel Ouaknine and James Worrell
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games
Marie van den Bogaard
Partial Order Reduction for Reachability Games
Frederik M. Bønneland, Peter Gjøl Jensen, Kim Guldstrand Larsen, Marco Muniz and Jiri Srba
On the Complexity of Reachability in Parametric Markov Decision Processes
Tobias Winkler, Sebastian Junges, Guillermo Perez and Joost-Pieter Katoen
Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives
Florent Delgrange, Thomas Brihaye, Youssouf Oualhadj and Mickael Randour
On Reachability Problems for Low-Dimensional Matrix Semigroups
Thomas Colcombet, Joel Ouaknine, Pavel Semukhin and James Worrell
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
Cas Widdershoven and Stefan Kiefer
**********************************************************
*
* 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/
*
**********************************************************
Posts
