Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler

DOI10.1007/978-981-16-7443-3_6MaRDI QIDQ2090217zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 24 October 2022

Full work available at URL https://doi.org/10.1007/978-981-16-7443-3_6

zbMATH Keywords

model checkingfinite-memory schedulersgeneralized possibilistic computation tree logicoptimal schedulerspossibilistic decision processes

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Computation tree logic model checking based on possibility measures
• scientific article; zbMATH DE number 6454071
• Validation of Stochastic Systems
• Fixed-point semantics of computation tree logic based on generalized possibility measures
• Model checking of reachability problems based on generalized possibility measures

Cites work

• scientific article; zbMATH DE number 7088727 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Computation tree logic model checking based on multi-valued possibility measures
• Computation tree logic model checking based on possibility measures
• Fuzzy sets
• Fuzzy sets as a basis for a theory of possibility
• Model checking fuzzy computation tree logic
• Possibility theory and statistical reasoning
• Possibility theory, probability theory and multiple-valued logics: a clarification
• Probabilities, possibilities, and fuzzy sets
• Quantitative model checking of linear-time properties based on generalized possibility measures
• The legacy of 50 years of fuzzy sets: a discussion

Cited in

(2)

• Generalized possibility computation tree logic with frequency and its model checking
• Computing sufficient and necessary conditions in CTL: a forgetting approach

Describes a project that uses

Uses Software

• MADM

This page was built for publication: Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler

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