Graded computation tree logic

DOI10.1145/2287718.2287725MaRDI QIDQ2946674zbMATH OpenOpenAlexWikidataFDO

Authors Alessandro Bianco, Fabio Mogavero, Aniello Murano

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.8955

zbMATH Keywords

Branching temporal logicsgraded modalitiesmu-calculussatisfiabilityspecification

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Graded Computation Tree Logic with Binary Coding
• On CTL* with Graded Path Modalities
• CTL^ with graded path modalities
• Graded alternating-time temporal logic
• Model checking for graded CTL

Cited in

(17)

• Axiomatising extended computation tree logic
• Graded modalities in strategy logic
• Reasoning about graded strategy quantifiers
• Sublogics of a branching time logic of robustness
• CTL^ with graded path modalities
• Model-checking graded computation-tree logic with finite path semantics
• PSpace reasoning for graded modal logics
• Reasoning about strategies: on the model-checking problem
• Model checking for graded CTL
• CTL Model-Checking with Graded Quantifiers
• Logics in computer science. A study on extensions of temporal and strategic logics
• Graded Computation Tree Logic with Binary Coding
• Branching-Time Temporal Logics with Minimal Model Quantifiers
• scientific article; zbMATH DE number 1341607 (Why is no real title available?)
• scientific article; zbMATH DE number 2090317 (Why is no real title available?)
• Quantifying Bounds in Strategy Logic
• Graded alternating-time temporal logic

This page was built for publication: Graded computation tree logic

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