Infinity 2002   -   Accepted Papers

• The synchronized graphs trace the context-sensitive languages
  Chloé Rispal
  Abstract
  
  
• Deciding Framed Bisimilarity
  Hans Huttel
  Abstract
  
  
• Some Remarks on Weak Bisimilarity of BPA-Processes
  Jitka Stribrna and Ivana Cerna
  Abstract
  
  
• Undecidability of LTL for Timed Petri Nets
  Parosh Aziz Abdulla and Aletta Nylen
  Abstract
  
  
• Uniform Solution of Parity Games on Prefix-Recognizable Graphs
  Thierry Cachat
  Abstract
  
  
• Monotonic Extensions of Petri Nets: Foward and Backward Search Revisited
  A. Finkel, J.-F. Raskin, M. Samuelides, L. Van Begin
  Abstract
  
  
• Rewriting in the partial algebra of typed terms modulo ACI
  Thomas Colcombet
  Abstract
  
  
• Abstract Families of Graphs
  Tanguy Urvoy
  Abstract