Sunday, August 27, 2023

[DMANET] Reachabilty Problems RP'2023: Call For Participation

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

Reachabilty Problems RP 2023: Call For Participation

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


17th International Conference on Reachability Problems (RP'23)

October 11-13 2023, Nice, FRANCE

https://www.lix.polytechnique.fr/RP2023


EARLY REGISTRATION DEADLINE: September 20, 2023

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


The International Conference on Reachability Problems (RP) 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
* Graphs and dynamical networks
* Hybrid dynamical systems
* Logic and model checking
* Verification of finite and infinite-state systems

REGISTRATION

See https://www.lix.polytechnique.fr/RP2023/i.php?n=Main.Registration

INVITED SPEAKERS

* Nathalie Aubrun (CNRS, Paris-Saclay, France)
* Zaitsev Dmitry (Odessa State Environmental University, Ukraine, and
Université Côte d'Azur, France)
* Jarkko Kari (University of Turku, Finland)
* Bruno Martin (University of Nice, France)
* Shinnosuke Seki (University of Electro-Communications, Japan)

REGULAR PAPERS:

* Complexity of Reachability Problems in Neural Networks.
Author: Adrian Wurm.
* Weakly synchronous systems with three machines are Turing powerful.
Authors: Cinzia Di Giusto, Davide Ferré, Etienne Lozes and Nicolas Nisse.
* On the Identity and Group Problems for Complex Heisenberg Matrices
Authors: Paul Bell, Reino Niskanen, Igor Potapov and Pavel Semukhin.
* Reachability analysis of a class of hybrid gene regulatory networks
Authors: Honglu Sun, Maxime Folschette and Morgan Magnin.
* Quantitative Reachability Stackelberg-Pareto Synthesis is NEXPTIME-Complete
Authors: Thomas Brihaye, Véronique Bruyère and Gaspard Reghem.
* Multi-Weighted Reachability Games
Authors: Thomas Brihaye and Aline Goeminne.
* On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions
Author: Eike Neumann.
* Adaptive Directions for Bernstein-based Polynomial Set Evolution
Authors: Alberto Casagrande and Carla Piazza.
* Introducing Divergence for Infinite Probabilistic Models
Authors: Alain Finkel, Serge Haddad and Lina Ye.
* A Framework for the Competitive Analysis of Model Predictive Controllers
Authors: Ramesh Krishnamurthy, Stijn Bellis, Guillermo Perez, Tim
Leys, Ritam Raha and Joachim Denil.
* Matching Patterns with Variables Under Simon's Congruence
Authors: Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea,
Dirk Nowotka, Stefan Siemer and Max Wiedenhöft.
* Hypermonitor: A Python Prototype for Hyper Predictive Runtime Verification
Authors: Angelo Ferrando and Giorgio Delzanno.
* Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs
Authors: David Auger, Pierre Coucheney, Loric Duhazé and Kossi Roland Etse.

PRESENTATION-ONLY TALKS:

* Sleptsov Nets are Turing-complete.
Authors: Dmitry Zaitsev and Bernard Berthomieu
* Reenterable colored Petri net model of Ebola virus dynamics
Authors: Dmitry Zaitsev, Tatiana Shmeleva
* On Computing Optimal Temporal Branchings
Authors: Daniela Bubboloni, Costanza Catalano, Andrea Marino and Ana Silva
* Discontinuous IVPs with unique solutions
Authors: Riccardo Gozzi and Olivier Bournez
* Geometry of Reachability Sets of Vector Addition Systems
Authors: Roland Guttenberg, Michael Raskin and Javier Esparza
* Semënov Arithmetic, Affine VASS, and String Constraints
Authors: Andrei Draghici, Christoph Haase and Florin Manea
* Multiplicity Problems on Algebraic Series and Context-Free Grammars
Authors: Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa
Shirmohammadi and James Worrell
* Linear Loop Synthesis for Polynomial Invariants
Authors: George Kenison, Laura Kovács and Anton Varonka
* Higher-Dimensional Automata Theory
Author: Uli Fahrenberg.
* Universality and Forall-Exactness of Cost Register Automata with Few Registers
Authors: Laure Daviaud and Andrew Ryzhikov
* History-determinism vs. simulation
Author: Karoliina Lehtinen
* Energy Büchi Problems
Authors: Sven Dziadek, Uli Fahrenberg and Philipp Schlehuber


CONTACT

RP 2023 Contact: rp2023@easychair.org

**********************************************************
*
* 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/
*
**********************************************************