Fixed-point semantics of computation tree logic based on generalized possibility measures

DOI10.15983/J.CNKI.JSNU.2015.04.145MaRDI QIDQ3461727zbMATH OpenFDO

Authors Nanyi Deng, Xingxing Zhang, Yongming Li

Publication date 15 January 2016

Full work available at URL https://doi.org/10.15983/J.CNKI.JSNU.2015.04.145

zbMATH Keywords

computation-tree logicfixed-point semanticsgeneralized possibility measuresmodel checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 6454071
• Computation tree logic model checking based on possibility measures
• Some properties of computation tree logic under possibility measures
• Fixed-point logics and computation
• Computation tree logic model checking based on multi-valued possibility measures

Cited in

(3)

• Semantics of non-deterministic possibility computation
• Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler
• Model checking of reachability problems based on generalized possibility measures

This page was built for publication: Fixed-point semantics of computation tree logic based on generalized possibility measures

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