No label defined (Q4733398)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4119616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4119616 |
Statements
1989
0 references
branching-time logic
0 references
temporal logic
0 references
expressiveness
0 references
computation tree logics
0 references
linear-time logic
0 references
fairness
0 references
0.8572037816047668
0 references
0.8278197646141052
0 references
0.8125750422477722
0 references
0.8089237213134766
0 references
0.8068091869354248
0 references
[For the entire collection see Zbl 0683.68001.] The first two sections introduce the computation tree logics CTL and \(\mathrm{CTL}^*\), and the linear-time logic LTL. Section 3 gives a simple characterization of those \(\mathrm{CTL}^*\) formulas that can be expressed in LTL. Namely, the formula \(f\in \mathrm{CTL}^*\) can be expressed in LTL iff it is equivalent to the formula \(Af'\), where \(A\) is the path universal quantifier, and \(f'\) is obtained from \(f\) by deleting the path quantifiers. Section 4 offers a necessary condition that a \(\mathrm{CTL}^*\) formula must satisfy in order to be expressible in CTL. The condition is formulated in terms of models which are labelled state transition graphs with fairness constraints. The result entails simpler arguments that strong fairness cannot be expressed in CTL, or that CTL and LTL have different expressive powers. Section 5 discusses open problems in the field.
0 references