Formal modelling and verification of probabilistic resource bounded agents
From MaRDI portal
Publication:6190087
Cites work
- scientific article; zbMATH DE number 4060392 (Why is no real title available?)
- scientific article; zbMATH DE number 1361121 (Why is no real title available?)
- scientific article; zbMATH DE number 1153199 (Why is no real title available?)
- scientific article; zbMATH DE number 2087806 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 5593264 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Modal Logic for Coalitional Power in Games
- Algorithms for stochastic games ? A survey
- Alternating-time temporal logic
- Alternating-time temporal logic with resource bounds
- Automatic verification of competitive stochastic systems
- Complete axiomatization and decidability of alternating-time temporal logic
- Expressing properties of coalitional ability under resource bounds
- Expressing properties of resource-bounded systems: the logics RTL\(^{*}\) and RTL
- Logic for coalitions with bounded resources
- Model checking of probabilistic and nondeterministic systems
- On a logic for coalitional games with priced-resource agents
- On the complexity of resource-bounded logics
- On the computational complexity of qualitative coalitional games
- Quantitative multi-objective verification for probabilistic systems
- Reasoning about actions meets strategic logics
- Reasoning about coalitional games
- Stochastic model checking
- Strategic reasoning with a bounded number of resources: the quest for tractability
This page was built for publication: Formal modelling and verification of probabilistic resource bounded agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190087)
