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

DOI10.1007/978-981-16-7443-3_6OpenAlexW3213779030MaRDI QIDQ2090217

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)

Related Items (1)

Computing sufficient and necessary conditions in CTL: a forgetting approach

Uses Software

• MADM

Cites Work

• Computation tree logic model checking based on possibility measures
• Model checking fuzzy computation tree logic
• Possibility theory and statistical reasoning
• Fuzzy sets as a basis for a theory of possibility
• Quantitative model checking of linear-time properties based on generalized possibility measures
• Probabilities, possibilities, and fuzzy sets
• The legacy of 50 years of fuzzy sets: a discussion
• Computation tree logic model checking based on multi-valued possibility measures
• Possibility theory, probability theory and multiple-valued logics: a clarification
• Fuzzy sets
• Unnamed Item
• Unnamed Item

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