Module checking of pushdown multi-agent systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1670555 (Why is no real title available?)
- scientific article; zbMATH DE number 3870578 (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 2080197 (Why is no real title available?)
- scientific article; zbMATH DE number 7317259 (Why is no real title available?)
- ATL* Satisfiability Is 2EXPTIME-Complete
- Alternating-time temporal logic
- Alternation
- Augmenting ATL with strategy contexts
- Enriched MU-Calculi Module Checking
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Improved model checking of hierarchical systems
- On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking
- Program Complexity in Hierarchical Module Checking
- Pushdown module checking
- Pushdown module checking with imperfect information
- Quantified CTL: expressiveness and complexity
- Reachability analysis of pushdown automata: Application to model-checking
- Reasoning about strategies: on the model-checking problem
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
- Strategy logic
- Verification, Model Checking, and Abstract Interpretation
- Winning Regions of Pushdown Parity Games: A Saturation Method
- “Sometimes” and “not never” revisited
This page was built for publication: Module checking of pushdown multi-agent systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6840503)
