Graded computation tree logic
From MaRDI portal
Publication:2946674
DOI10.1145/2287718.2287725zbMath1351.68153OpenAlexW2114893507MaRDI QIDQ2946674
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
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (8)
Graded modalities in strategy logic ⋮ Reasoning About Strategies ⋮ Reasoning about graded strategy quantifiers ⋮ Sublogics of a branching time logic of robustness ⋮ CTL\(^\ast\) with graded path modalities ⋮ Model-checking graded computation-tree logic with finite path semantics ⋮ Quantifying Bounds in Strategy Logic ⋮ Branching-Time Temporal Logics with Minimal Model Quantifiers
This page was built for publication: Graded computation tree logic
