Practical Aspects of Declarative Languages

Volume 1990 of the series Lecture Notes in Computer Science pp 245-258


Constraint Database Models Characterizing Timed Bisimilarity

  • Supratik MukhopadhyayAffiliated withMax-Planck-Institut für Informatik
  • , Andreas PodelskiAffiliated withMax-Planck-Institut für Informatik

* Final gross prices may vary according to local VAT.

Get Access


The problem of deciding timed bisimilarity has received increasing attention; it is important for verification of timed systems. Using a characterization of timed bisimilarity in terms of models of constraint databases, we present to our knowledge, the first local, symbolic algorithm for deciding timed bisimilarity; previous algorithms were based on a finite, but prohibitively large, abstraction (the region graph or the full backward stable graph). Our algorithm uses XSB-style tabling with constraints. Our methodology is more general than those followed in the previous approaches in the sense that our algorithm can be used to decide whether two timed systems are alternating timed bisimilar.