Incremental model checking for fuzzy computation tree logic
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1759610 (Why is no real title available?)
- scientific article; zbMATH DE number 2102712 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
- Approximate bisimulations for fuzzy-transition systems
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic
- Characterization and computation of approximate bisimulations for fuzzy automata
- Computation tree logic model checking based on possibility measures
- Computer Aided Verification
- Data structures for symbolic multi-valued model-checking
- Depth-bounded fuzzy simulations and bisimulations between fuzzy automata
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- Fuzzy sets
- Incremental graph pattern matching
- Introduction to algorithms.
- Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Model checking fuzzy computation tree logic
- Multi-valued verification of strategic ability
- On the computational complexity of dynamic graph problems
- Reasoning about Quality and Fuzziness of Strategic Behaviors
- Shortest Path Tree Computation in Dynamic Graphs
- Symbolic checking of fuzzy CTL on fuzzy program graph
- Triangular norms
This page was built for publication: Incremental model checking for fuzzy computation tree logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6905681)
