CTL Model-Checking with Graded Quantifiers
From MaRDI portal
Recommendations
Cites work
- Complexity Results for First-Order Two-Variable Logic with Counting
- Counterexamples revisited: principles, algorithms, applications
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 140398 (Why is no real title available?)
- scientific article; zbMATH DE number 1852164 (Why is no real title available?)
- scientific article; zbMATH DE number 2090317 (Why is no real title available?)
- scientific article; zbMATH DE number 2102731 (Why is no real title available?)
- In so many possible worlds
- Introduction to algorithms
- Packing cycles in undirected graphs
- PSpace reasoning for graded modal logics
Cited in
(6)
This page was built for publication: CTL Model-Checking with Graded Quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540061)