Volume 9, 1997

• 
  Faron Moller: Preface. 1
• 
  Felice Balarin: Verifying invariants by approximate image computation. 2-14
• 
  Zakaria Bouziane, Alain Finkel: Cyclic Petri net reachability sets are semi-linear effectively constructible. 15-24
• 
  Olaf Burkart: Model checking rationally restricted right closures of recognizable graphs. 25
• 
  Dennis Dams, Rob Gerth: The bounded retransmission protocol revisited. 26
• 
  Alain Finkel, Bernard Willems, Pierre Wolper: A direct symbolic approach to model checking pushdown systems. 27-37
• 
  Laurent Fribourg, Hans Olsén: Reachability sets of parameterized rings as regular languages. 40
• 
  Petr Jancar, Antonín Kucera: Bisimilarity of processes with finite-state systems. 41
• 
  David Lesens, Hassen Saïdi: Abstraction of parameterized networks. 42
• 
  Géraud Sénizergues: L(A) = L(B)? 43
• 
  Jitka Stríbrná: Decidability of strong bisimulation of basic parallel processes using Hilbert's basis theorem. 44

last updated on Sat May 18 06:06:35 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page