Constraint Database Models Characterizing Timed Bisimilarity

  • Supratik Mukhopadhyay
  • Andreas Podelski
Conference paper

DOI: 10.1007/3-540-45241-9_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1990)
Cite this paper as:
Mukhopadhyay S., Podelski A. (2001) Constraint Database Models Characterizing Timed Bisimilarity. In: Ramakrishnan I.V. (eds) Practical Aspects of Declarative Languages. PADL 2001. Lecture Notes in Computer Science, vol 1990. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Supratik Mukhopadhyay
    • 1
  • Andreas Podelski
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations