Model checking for graded CTL

DOI10.3233/FI-2009-181MaRDI QIDQ3400570zbMATH OpenFDO

Authors Alessandro Ferrante, Margherita Napoli, Mimmo Parente

Publication date 5 February 2010

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2009-181

zbMATH Keywords

Computational Tree Logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• CTL Model-Checking with Graded Quantifiers
• CTL^ with graded path modalities
• On CTL* with Graded Path Modalities
• Graded Computation Tree Logic with Binary Coding
• Graded computation tree logic

Cited in

(10)

• Reasoning about graded strategy quantifiers
• CTL^ with graded path modalities
• Model-checking graded computation-tree logic with finite path semantics
• Graded computation tree logic
• Model Checking CTL is Almost Always Inherently Sequential
• On CTL* with Graded Path Modalities
• CTL Model-Checking with Graded 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?)
• Model checking in the modal -calculus and generic solutions

This page was built for publication: Model checking for graded CTL

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