Electronic Notes in Theoretical Computer Science, Volume 223

Volume 223, December 2008

• Vesa Halava, Igor Potapov:
  Preface. 1-2
  Electronic Edition (link) BibTeX
• Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
  Monotonic Abstraction in Parameterized Verification. 3-14
  Electronic Edition (link) BibTeX
• Juhani Karhumäki:
  Reachability via Cooperating Morphisms. 15-27
  Electronic Edition (link) BibTeX
• Étienne André, Thomas Chatain, Laurent Fribourg, Emmanuelle Encrenaz:
  An Inverse Method for Parametric Timed Automata. 29-46
  Electronic Edition (link) BibTeX
• Kerstin Bauer, Raffaella Gentilini, Klaus Schneider:
  Approximated Reachability on Hybrid Automata: Falsification meets Certification. 47-60
  Electronic Edition (link) BibTeX
• Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko:
  Handling Left-Quadratic Rules When Completing Tree Automata. 61-70
  Electronic Edition (link) BibTeX
• Nathaniel Charlton, Michael Huth:
  Falsifying Safety Properties Through Games on Over-approximating Models. 71-86
  Electronic Edition (link) BibTeX
• Pieter Collins, Alexandre Goldsztejn:
  The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems. 87-102
  Electronic Edition (link) BibTeX
• Ingo Felscher:
  The Compositional Method and Regular Reachability. 103-117
  Electronic Edition (link) BibTeX
• Jan Friso Groote, Bas Ploeger:
  Switching Graphs. 119-135
  Electronic Edition (link) BibTeX
• Kai Lampka:
  A New Algorithm for Partitioned Symbolic Reachability Analysis. 137-151
  Electronic Edition (link) BibTeX
• Marisa Llorens, Javier Oliver, Josep Silva, Salvador Tamarit, Germán Vidal:
  Dynamic Slicing Techniques for Petri Nets. 153-165
  Electronic Edition (link) BibTeX
• Maurice Margenstern, Yu Song:
  A Universal Cellular Automaton on the Ternary Heptagrid. 167-185
  Electronic Edition (link) BibTeX
• Pavel Martyugin:
  The Length of Subset Reachability in Nondeterministic Automata. 187-200
  Electronic Edition (link) BibTeX
• Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer:
  The Complexity of Satisfiability for Fragments of CTL and CTL^*. 201-213
  Electronic Edition (link) BibTeX
• M. Praveen, Kamal Lodaya:
  Analyzing Reachability for Some Petri Nets With Fast Growing Markings. 215-237
  Electronic Edition (link) BibTeX
• Klaus Reinhardt:
  Reachability in Petri Nets with Inhibitor Arcs. 239-264
  Electronic Edition (link) BibTeX