Pages that link to "Item:Q979079"
From MaRDI portal
The following pages link to Solving games via three-valued abstraction refinement (Q979079):
Displaying 10 items.
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- An abstraction-refinement framework for trigger querying (Q2248101) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- Relay reachability algorithm for exploring huge state space (Q2852022) (← links)
- Abstraction Refinement for Games with Incomplete Information. (Q3165957) (← links)
- Lazy Abstraction-Based Controller Synthesis (Q3297583) (← links)
- (Q4411832) (← links)
- Automated Technology for Verification and Analysis (Q5394227) (← links)
- An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information (Q6098854) (← links)
- Timed automata verification and synthesis via finite automata learning (Q6536137) (← links)