Generalized possibility computation tree logic with frequency and its model checking
From MaRDI portal
Cites work
- Approximation and robustness of fuzzy finite automata
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Computation tree logic model checking based on multi-valued possibility measures
- Computation tree logic model checking based on possibility measures
- Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler
- Finding All the Elementary Circuits of a Directed Graph
- Fuzzy sets
- Fuzzy sets as a basis for a theory of possibility
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 7319046 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Lattice-valued simulations for quantitative transition systems
- Model checking fuzzy computation tree logic
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- On frequency LTL in probabilistic systems
- Possibilistic semantics for a modal KD45 extension of Gödel fuzzy logic
- Possibility theory and statistical reasoning
- Possibility theory, probability theory and multiple-valued logics: a clarification
- Probabilistic \(\mu\)-calculus: decidability and complete axiomatization
- Quantitative model checking of linear-time properties based on generalized possibility measures
- Reasoning about knowledge and conditional probability
- The transport problem for non-additive measures
This page was built for publication: Generalized possibility computation tree logic with frequency and its model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596703)
