Model checking for graded CTL

DOI10.3233/FI-2009-181zbMATH Open1213.68375MaRDI QIDQ3400570FDOQ3400570

Margherita Napoli, Alessandro Ferrante, Mimmo Parente

Publication date: 5 February 2010

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Recommendations

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

zbMATH Keywords

Computational Tree Logic

Mathematics Subject Classification ID

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

Cited In (7)

• Model-checking graded computation-tree logic with finite path semantics
• CTL\(^\ast\) with graded path modalities
• Reasoning about graded strategy quantifiers
• On CTL* with Graded Path Modalities
• Title not available (Why is that?)
• CTL Model-Checking with Graded Quantifiers
• Model Checking CTL is Almost Always Inherently Sequential

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)