


default search action
15th RP 2021: Liverpool, UK
- Paul C. Bell
, Patrick Totzke
, Igor Potapov
:
Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings. Lecture Notes in Computer Science 13035, Springer 2021, ISBN 978-3-030-89715-4
Invited Papers
- Udi Boker:
Quantitative vs. Weighted Automata. 3-18 - Clare Dixon
:
Theorem Proving Using Clausal Resolution: From Past to Present. 19-27 - Javier Esparza
:
Population Protocols: Beyond Runtime Analysis. 28-51 - Georg Zetzsche
:
Recent Advances on Reachability Problems for Valence Systems (Invited Talk). 52-65
Regular Papers
- Alexander Bilgram, Peter Gjøl Jensen
, Thomas Pedersen, Jirí Srba
, Jakob Haahr Taankvist:
Improvements in Unfolding of Colored Petri Nets. 69-84 - Marcelo Forets
, Christian Schilling
:
Reachability of Weakly Nonlinear Systems Using Carleman Linearization. 85-99 - Oleg Karpenkov
:
Continued Fraction Approach to Gauss Reduction Theory. 100-114 - Maria Kosche
, Tore Koß
, Florin Manea
, Stefan Siemer
:
Absent Subsequences in Words. 115-131 - Joseph Livesey, Dominik Wojtczak
:
Minimal Number of Calls in Propositional Protocols. 132-148 - Marco Sälzer
, Martin Lange
:
Reachability is NP-Complete Even for the Simplest Neural Networks. 149-164

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.