Pages that link to "Item:Q529055"
From MaRDI portal
The following pages link to Computation tree logic model checking based on possibility measures (Q529055):
Displaying 14 items.
- Model checking fuzzy computation tree logic (Q529056) (← links)
- Model checking computation tree logic over finite lattices (Q896917) (← links)
- Quantitative model checking of linear-time properties based on generalized possibility measures (Q1697514) (← links)
- Computation tree measurement language (CTML) (Q1798671) (← links)
- On characterization of fuzzy tree pushdown automata (Q2001163) (← links)
- Coherent checking and updating of Bayesian models without specifying the model space: a decision-theoretic semantics for possibility theory (Q2076971) (← links)
- Lattice-valued tree pushdown automata: pumping lemma and closure properties (Q2076992) (← links)
- Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler (Q2090217) (← links)
- Computation tree logic model checking based on multi-valued possibility measures (Q2213111) (← links)
- Model checking of linear-time properties in multi-valued systems (Q2282319) (← links)
- Fixed-point semantics of computation tree logic based on generalized possibility measures (Q3461727) (← links)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS (Q4626611) (← links)
- Model Checking Quantified Computation Tree Logic (Q5756604) (← links)
- Generalized possibility computation tree logic with frequency and its model checking (Q6596703) (← links)