scientific article; zbMATH DE number 3993549

From MaRDI portal
Publication:4722045





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4722045)