default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th RP 2019: Brussels, Belgium
- Emmanuel Filiot, Raphaël M. Jungers, Igor Potapov:
Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings. Lecture Notes in Computer Science 11674, Springer 2019, ISBN 978-3-030-30805-6 - Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný
:
Bidding Games on Markov Decision Processes. 1-12 - Vladimir Yu. Protasov:
Primitivity and Synchronizing Automata: A Functional Analytic Approach. 13-21 - Sriram Sankaranarayanan, Souradeep Dutta, Sergio Mover:
Reaching Out Towards Fully Verified Autonomous Systems. 22-32 - Václav Blazej, Jan Matyás Kristan, Tomás Valla:
On the m-eternal Domination Number of Cactus Graphs. 33-47 - Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset:
On Relevant Equilibria in Reachability Games. 48-62 - Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines:
Partial Solvers for Generalized Parity Games. 63-78 - Ventsislav Chonev:
Reachability in Augmented Interval Markov Chains. 79-92 - Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen:
On Solving Word Equations Using SAT. 93-106 - Giorgio Delzanno:
Parameterised Verification of Publish/Subscribe Networks with Exception Handling. 107-120 - Nazim Fatès, Irène Marcovici, Siamak Taati:
Cellular Automata for the Self-stabilisation of Colourings and Tilings. 121-136 - Christopher Hampson:
On the Termination Problem for Counter Machines with Incrementing Errors. 137-148 - Chris Köcher:
Reachability Problems on Partially Lossy Queue Automata. 149-163 - Pierre-Alain Reynier, Frédéric Servais:
On the Computation of the Minimal Coverability Set of Petri Nets. 164-177 - Andrei Sandler, Olga Tveretina:
Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds. 178-192 - Sylvain Schmitz, Georg Zetzsche:
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. 193-201 - Ronny Tredup:
Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results. 202-217 - Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis, Louwe B. Kuijer:
Reachability of Five Gossip Protocols. 218-231
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.
last updated on 2024-10-25 20:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
