From Reachability Problems 2009
Accepted Papers
(by order of submission)
- Maurice Margenstern. The periodic domino problem is undecidable in the hyperbolic plane.
- Eero Lehtonen. An Undecidable Permutation of the Natural Numbers.
- Yohan Boichut, Pierre-Cyrille Heam and Olga Kouchnarenko. How to Tackle Integer Weighted Automata Positivity.
- Denis Lugiez. Forward Analysis of Dynamic Networks of Pushdown Systems is Easier without Order.
- Parosh Aziz Abdulla, Giorgio Delzanno and Ahmed Rezine. Automatic Verification of Directory-based Consistency Protocols.
- Anil Vullikanti, Henning Mortveit and Matt Macauley. Limit Set Reachability in Asynchronous Graph Dynamical Systems.
- Amaldev Manuel and R. Ramanujam. Counting multiplicity over infinite alphabets.
- Christoph Minnameier and Mila Majster-Cederbaum. Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-based Systems.
- Roberto Barbuti, Francesca Levi, Paolo Milazzo and Guido Scatena. Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates.
- Pieter Collins and Ivan Zapreev. Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems.
- Kenneth McMillan and Lenore Zuck. Abstract Counterexamples for Non-Disjunctive Abstractions.
- Bastien Maubert and Sophie Pinchinat. ''Games with Opacity Condition.'
- Mohamed Faouzi Atig and Peter Habermehl. On Yen's Path Logic for Petri Nets.
- Mouna Chaouch-Saad, Bernadette Charron-Bost and Stephan Merz. A Reduction Theorem for the Verification of Round-Based Distributed Algorithms.
- Anil Seth. Games on Higher Order Multi-Stack Pushdown Systems.