Graded Computation Tree Logic with Binary Coding

DOI10.1007/978-3-642-15205-4_13zbMATH Open1287.68102OpenAlexW1503593284MaRDI QIDQ3586038FDOQ3586038

Authors: Alessandro Bianco, Fabio Mogavero, Aniello Murano 

Publication date: 3 September 2010

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15205-4_13

Recommendations

• Graded computation tree logic
• Extended computation tree logic
• Quantified computation tree logic
• Coding tree languages based on lattice-valued logic
• Model-checking graded computation-tree logic with finite path semantics
• scientific article; zbMATH DE number 1867119
• A note on binary grammatical codes of trees
• Paraconsistent computation tree logic
• A coinductive calculus of binary trees
• Axiomatising extended computation tree logic

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cited In (5)

• Reasoning About Strategies
• Reasoning about graded strategy quantifiers
• Title not available (Why is that?)
• CTL Model-Checking with Graded Quantifiers
• Model checking for graded CTL

This page was built for publication: Graded Computation Tree Logic with Binary Coding

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