Advertisement

Decidability

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

Abstract

In this chapter we consider a subset of formulas of DC for which the satisfiability of a formula is decidable. Since a formula ø is valid if the formula ¬ø is not satisfiable, we can decide whether a formula in the subset is valid as well. The decidability results presented here are based on [167].

Keywords

Discrete Time Continuous Time Decision Procedure Decidability Result 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