Enriched μ–Calculus Pushdown Module Checking
From MaRDI portal
Recommendations
Cites work
- An automata-theoretic approach to branching-time model checking
- Enriched μ-Calculi Module Checking
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3930354 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 1223729 (Why is no real title available?)
- scientific article; zbMATH DE number 1980931 (Why is no real title available?)
- scientific article; zbMATH DE number 1765663 (Why is no real title available?)
- scientific article; zbMATH DE number 2090317 (Why is no real title available?)
- Module checking
- On the undecidability of logics with converse, nominals, recursion and counting
- Pushdown Module Checking
- Results on the propositional \(\mu\)-calculus
- The Complexity of Enriched μ-Calculi
Cited in
(10)- Pushdown module checking with imperfect information
- Model checking the full modal mu-calculus for infinite sequential processes
- Pushdown Module Checking with Imperfect Information
- Enriched MU-Calculi Module Checking
- The Complexity of Enriched Mu-Calculi
- The Complexity of Enriched μ-Calculi
- scientific article; zbMATH DE number 7317259 (Why is no real title available?)
- Pushdown Module Checking
- Enriched μ-Calculi Module Checking
- Pushdown module checking
This page was built for publication: Enriched μ–Calculus Pushdown Module Checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498485)