No label defined (Q4722045)
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 3993549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3993549 |
Statements
1986
0 references
tense logic
0 references
parallelism
0 references
branching temporal logic
0 references
Fair Computation Tree Logic
0 references
fairness properties
0 references
decision procedure
0 references
0.8464521765708923
0 references
0.8330236673355103
0 references
0.8207155466079712
0 references
0.8065443634986877
0 references
0.8051255345344543
0 references
[For the entire collection see Zbl 0578.00004.] Branching tense logics are in certain ways preferable to linear tense logics for use in the design of correct concurrent programs. But they are problematic in two respects, expressive power and complexity of decision procedure. The authors present a branching temporal logic they call Fair Computation Tree Logic which can express a range of fairness properties: impartiality, strong fairness, limited looping fairness, etc. They then prove a Small Model theorem for FCTL and show that this leads to a decision procedure for FCTL which is of deterministic, single- exponential-time complexity.
0 references