9th International Workshop on Reachability Problems

      21 - 23 September 2015, Warsaw, Poland

List of Accepted Papers


Nathanaël Fijalkow and Michał Skrzypczak. Irregular Behaviours for Probabilistic Automata
Andrianarivelo Nirina and Pierre Rety. Over-Approximating Terms Reachable by Context-Sensitive Rewriting
Akihiro Yamamura. Rearranging Two Dimensional Arrays by Prefix Reversals
Antonia Lechner. Synthesis Problems for One-Counter Automata
Fribourg Laurent, Eric Goubault, Sameh Mohamed, Marian Mrozek and Sylvie Putot. A Topological Method for finding Invariants of Continuous Systems
Georg Zetzsche. The Emptiness Problem for Valence Automata Over Graph Monoids or: Another Extension of Petri Nets With Decidable Reachability
Ranko Lazic and Sylvain Schmitz. The Ideal View on Rackoff's Coverability Technique
Alexander Malkis. Multithreaded-Cartesian Abstract Interpretation of Multithreaded Recursive Programs is Polynomial
Masaya Shimakawa, Shigeki Hagihara and Naoki Yonezaki. Reducing Bounded Realizability Analysis to Reachability Checking
Jerome Leroux, Grégoire Sutre and Patrick Totzke. On Boundedness Problems for Pushdown Vector Addition Systems
Paul Hunter. Reachability in Succinct One-Counter Games
Petr Jancar. On reachability-related games on vector addition systems with states
Beatrice Berard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din and Mathieu Sassolas. Polynomial Interrupt Timed Automata
Étienne André, Didier Lime and Olivier H. Roux. Almost-Complete Synthesis for Bounded Parametric Timed Automata

Important dates:


Support

We acknowledge the kind support of

wcmcs

Dept. Mathematics, Informatics and Mechanics

University of Warsaw