FormalCheck Query Language Compared with CTL (1999)
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Zijiang Yang and Christine Chung and In-Ho Moon},
title = {FormalCheck Query Language Compared with CTL},
year = {1999}
}
Bookmarks
OpenURL
Abstract:
The logic CTL can express branching-time attributes that are not expressible with !-automata and conversely the FormalCheck Query Language (FQL) whose semantics is founded on !-automata can express sequentiality and eventuality behaviors that are not expressible with CTL (nor even its extension CTL ). Since both CTL and FQL are commonly used in model-checking, it is of interest to compare nonetheless related constructs common to both. In fact, there are subtle but important discrepancies between common FQL expressions and seemingly but not actually equivalent CTL formulae. In some cases these discrepancies illuminate common misunderstandings about the semantical meaning of the given CTL formula, and thus are of interest to CTL users irrespective of FQL. The root cause of these discrepancies is the inability of CTL to express "phase"-- an unbounded succession of disjoint time intervals in which a behavior (i.e., property or constraint) is required to hold. Phase is fundamental to FQL...
Citations
| 892 | Temporal and modal logic – Emerson - 1990 |
| 357 | Computer-aided verification of coordinating processes: the Automata-theoretic approach – Kurshan - 1994 |
| 15 | Relating linear and branching model checking – Kupferman, Vardi - 1998 |
| 6 | How linear can branching-time be – Grumberg, Kurshan - 1994 |
| 1 | Design Automation. Formalcheck user's guide. Lucent Technologies – Labs - 1998 |
| 1 | Testing the FormalCheck Query Library – Dershowitz, Fisler, et al. - 1997 |
| 1 | fairness not expressible in ctl – Strong |
| 1 | one, get one free!!! Journal of Logic and Computation, 6(4):523--539 – Buy - 1996 |
