default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd RP 2009: Palaiseau, France
- Olivier Bournez, Igor Potapov:
Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings. Lecture Notes in Computer Science 5797, Springer 2009, ISBN 978-3-642-04419-9 - Mohamed Faouzi Atig, Ahmed Bouajjani:
On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems. 1-2 - Thomas A. Henzinger, Barbara Jobstmann, Verena Wolf:
Formalisms for Specifying Markovian Population Models. 3-23 - Oded Maler:
Reachability for Continuous and Hybrid Systems. 24-25 - Alexander Shen
:
Algorithmic Information Theory and Foundations of Probability. 26-34 - Moshe Y. Vardi:
Model Checking as A Reachability Problem. 35 - Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
Automatic Verification of Directory-Based Consistency Protocols. 36-50 - Mohamed Faouzi Atig, Peter Habermehl:
On Yen's Path Logic for Petri Nets. 51-63 - Roberto Barbuti, Francesca Levi, Paolo Milazzo, Guido Scatena:
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates. 64-78 - Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
How to Tackle Integer Weighted Automata Positivity. 79-92 - Mouna Chaouch-Saad, Bernadette Charron-Bost, Stephan Merz:
A Reduction Theorem for the Verification of Round-Based Distributed Algorithms. 93-106 - Pieter Collins, Ivan S. Zapreev:
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems. 107-119 - Eero Lehtonen:
An Undecidable Permutation of the Natural Numbers. 120-126 - Denis Lugiez:
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order. 127-140 - Amaldev Manuel, Ramaswamy Ramanujam:
Counting Multiplicity over Infinite Alphabets. 141-153 - Maurice Margenstern:
The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane. 154-165 - Bastien Maubert, Sophie Pinchinat:
Games with Opacity Condition. 166-175 - Kenneth L. McMillan, Lenore D. Zuck:
Abstract Counterexamples for Non-disjunctive Abstractions. 176-188 - Mila E. Majster-Cederbaum, Christoph Minnameier:
Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems. 189-202 - Anil Seth:
Games on Higher Order Multi-stack Pushdown Systems. 203-216 - V. S. Anil Kumar, Matthew Macauley, Henning S. Mortveit:
Limit Set Reachability in Asynchronous Graph Dynamical Systems. 217-232
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 2026-08-02 00:55 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
