default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th RP 2015: Warsaw, Poland
- Mikolaj Bojanczyk, Slawomir Lasota
, Igor Potapov:
Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings. Lecture Notes in Computer Science 9328, Springer 2015, ISBN 978-3-319-24536-2 - Christel Baier:
Reasoning About Cost-Utility Constraints in Probabilistic Models. 1-6 - Étienne André, Didier Lime, Olivier H. Roux:
Integer-Complete Synthesis for Bounded Parametric Timed Automata. 7-19 - Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas:
Polynomial Interrupt Timed Automata. 20-32 - Nathanaël Fijalkow, Michal Skrzypczak:
Irregular Behaviours for Probabilistic Automata. 33-36 - Paul Hunter:
Reachability in Succinct One-Counter Games. 37-49 - Petr Jancar:
On Reachability-Related Games on Vector Addition Systems with States. 50-62 - Laurent Fribourg, Eric Goubault, Sameh Mohamed, Marian Mrozek, Sylvie Putot:
A Topological Method for Finding Invariant Sets of Continuous Systems. 63-75 - Ranko Lazic, Sylvain Schmitz:
The Ideal View on Rackoff's Coverability Technique. 76-88 - Antonia Lechner:
Synthesis Problems for One-Counter Automata. 89-100 - Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On Boundedness Problems for Pushdown Vector Addition Systems. 101-113 - Alexander Malkis:
Multithreaded-Cartesian Abstract Interpretation of Multithreaded Recursive Programs Is Polynomial. 114-127 - Nirina Andrianarivelo, Pierre Réty:
Over-Approximating Terms Reachable by Context-Sensitive Rewriting. 128-139 - Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki:
Reducing Bounded Realizability Analysis to Reachability Checking. 140-152 - Akihiro Yamamura:
Rearranging Two Dimensional Arrays by Prefix Reversals. 153-165 - Georg Zetzsche:
The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets. 166-178
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 2025-02-20 19:50 CET 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:
