Model Checking: Linear Duration Invariants
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.
KeywordsNormal Form Model Check Linear Programming Problem Regular Expression Regular Language
Unable to display preview. Download preview PDF.