Electronic Notes in Theoretical Computer Science, Volume 223
Volume 223, December 2008
- Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine: Monotonic Abstraction in Parameterized Verification. 3-14
- Juhani Karhumäki: Reachability via Cooperating Morphisms. 15-27
- Étienne André, Thomas Chatain, Laurent Fribourg, Emmanuelle Encrenaz: An Inverse Method for Parametric Timed Automata. 29-46
- Kerstin Bauer, Raffaella Gentilini, Klaus Schneider: Approximated Reachability on Hybrid Automata: Falsification meets Certification. 47-60
- Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko: Handling Left-Quadratic Rules When Completing Tree Automata. 61-70
- Nathaniel Charlton, Michael Huth: Falsifying Safety Properties Through Games on Over-approximating Models. 71-86
- Pieter Collins, Alexandre Goldsztejn: The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems. 87-102
- Ingo Felscher: The Compositional Method and Regular Reachability. 103-117
- Kai Lampka: A New Algorithm for Partitioned Symbolic Reachability Analysis. 137-151
- Marisa Llorens, Javier Oliver, Josep Silva, Salvador Tamarit, Germán Vidal: Dynamic Slicing Techniques for Petri Nets. 153-165
- Pavel Martyugin: The Length of Subset Reachability in Nondeterministic Automata. 187-200
- Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer: The Complexity of Satisfiability for Fragments of CTL and CTL*. 201-213
- M. Praveen, Kamal Lodaya: Analyzing Reachability for Some Petri Nets With Fast Growing Markings. 215-237
- Klaus Reinhardt: Reachability in Petri Nets with Inhibitor Arcs. 239-264
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team