Advertisement

Model Checking: Linear Duration Invariants

  • Zhou Chaochen
  • Michael R. Hansen
Part of the Monographs in Theoretical Computer Science An EATCS Series book series (EATCS)

Abstract

In Chap. 7, it was proved that the satisfiability (and validity) of simple subclasses of DC formulas is undecidable for both the continuous- and the discrete-time domains. In Chap. 6, decidable subclasses of DC formulas were identified. Some are decidable for both the continuous- and the discrete-time domains, while others are decidable for discrete time only.

Keywords

Normal Form Model Check Linear Programming Problem Regular Expression Regular Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Zhou Chaochen
    • 1
  • Michael R. Hansen
    • 2
  1. 1.Institute of SoftwareChinese Academy of SciencesBeijingChina
  2. 2.Informatics and Mathematical ModellingTechnical University DenmarkLyngbyDenmark

Personalised recommendations