A formal approach to attack graphs
From MaRDI portal
Cites work
- Alternating-time temporal logic
- An automata-theoretic approach to branching-time model checking
- Approximate solutions for attack graph games with imperfect information
- Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
- Automatic verification of competitive stochastic systems
- Fixed-dimensional energy games are in pseudo-polynomial time
- Generalized mean-payoff and energy games
- Graded alternating-time temporal logic
- Graded modalities in strategy logic
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1153199 (Why is no real title available?)
- scientific article; zbMATH DE number 2102731 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2003
- Mechanizing Mathematical Reasoning
- Module checking
- Natural strategic ability
- Reasoning about strategies: on the model-checking problem
- The complexity of two-player games of incomplete information
- Verification of multi-agent systems with public actions against strategy logic
This page was built for publication: A formal approach to attack graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913850)