


default search action
16th RP 2022, Kaiserslautern, Germany
- Anthony W. Lin, Georg Zetzsche, Igor Potapov:

Reachability Problems - 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings. Lecture Notes in Computer Science 13608, Springer 2022, ISBN 978-3-031-19134-3
Invited Papers
- Yotam M. Y. Feldman

, Sharon Shoham:
SAT-Based Invariant Inference and Its Relation to Concept Learning. 3-27 - Laura Ciobanu

:
Post's Correspondence Problem: From Computer Science to Algebra. 28-36 - Michael Benedikt:

The Past and Future of Embedded Finite Model Theory. 37-46
Regular Papers
- Michele Boreale, Luisa Collodi:

Linearization, Model Reduction and Reachability in Nonlinear odes. 49-66 - Sougata Bose

, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke
:
History-Deterministic Timed Automata Are Not Determinizable. 67-76 - Tomoyuki Yamakami:

Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata. 77-92 - Thomas Webster:

The Stochastic Arrival Problem. 93-107 - Kazuyuki Asada

, Hiroyuki Katsura
, Naoki Kobayashi
:
On Higher-Order Reachability Games Vs May Reachability. 108-124 - A. R. Balasubramanian

:
Coefficient Synthesis for Threshold Automata. 125-139 - Maria Kosche

, Tore Koß
, Florin Manea
, Viktoriya Pak:
Subsequences in Bounded Ranges: Matching and Analysis Problems. 140-159 - Lorenzo Capra

:
Canonization of Reconfigurable PT Nets in Maude. 160-177

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














