Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler
DOI10.1007/978-981-16-7443-3_6OpenAlexW3213779030MaRDI QIDQ2090217FDOQ2090217
Authors: Yanyan Li 
Publication date: 24 October 2022
Full work available at URL: https://doi.org/10.1007/978-981-16-7443-3_6
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
model checkingfinite-memory schedulersgeneralized possibilistic computation tree logicoptimal schedulerspossibilistic decision processes
Reasoning under uncertainty in the context of artificial intelligence (68T37) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Fuzzy sets as a basis for a theory of possibility
- Fuzzy sets
- Possibility theory, probability theory and multiple-valued logics: a clarification
- Title not available (Why is that?)
- Possibility theory and statistical reasoning
- Title not available (Why is that?)
- Probabilities, possibilities, and fuzzy sets
- Computation tree logic model checking based on possibility measures
- Model checking fuzzy computation tree logic
- Quantitative model checking of linear-time properties based on generalized possibility measures
- The legacy of 50 years of fuzzy sets: a discussion
- Computation tree logic model checking based on multi-valued possibility measures
Cited In (2)
Uses Software
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)
