Strategy Synthesis for Multi-dimensional Quantitative Objectives - PowerPoint PPT Presentation

Strategy Synthesis for Multi-dimensional Quantitative Objectives Krishnendu Chatterjee 1 Mickael Randour 2 cois Raskin 3 Jean-Fran¸ 1 IST Austria 2 UMONS 3 ULB 18.04.2012

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Aim of this work Controller synthesis ⊲ functional properties ⊲ quantitative requirements Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 1 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Aim of this work Controller synthesis ⊲ functional properties ⊲ quantitative requirements Implementable controllers � restriction to finite-memory strategies. Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 1 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Aim of this work Study games with ⊲ multi-dimensional quantitative objectives (energy and mean-payoff) ⊲ and a parity objective. � First study of such a conjunction. Address questions that revolve around strategies : ⊲ bounds on memory, ⊲ synthesis algorithm, ? ⊲ randomness ∼ memory. Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 2 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Results Overview Memory bounds MEPGs MMPPGs optimal finite-memory optimal optimal exp. exp. infinite [CDHR10] Strategy synthesis (finite memory) MEPGs MMPPGs EXPTIME EXPTIME Randomness as a substitute for finite memory MEGs EPGs MMP(P)Gs MPPGs √ √ × × one-player √ two-player × × × Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 3 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion 1 Classical energy and mean-payoff games 2 Extensions to multi-dimensions and parity 3 Memory bounds 4 Strategy synthesis 5 Randomization as a substitute to finite-memory 6 Conclusion and ongoing work Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 4 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion 1 Classical energy and mean-payoff games 2 Extensions to multi-dimensions and parity 3 Memory bounds 4 Strategy synthesis 5 Randomization as a substitute to finite-memory 6 Conclusion and ongoing work Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 5 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Turn-based games s 0 G = ( S 1 , S 2 , s init , E ) S = S 1 ∪ S 2 , S 1 ∩ S 2 = ∅ , E ⊆ S × S s 1 s 2 P 1 states = P 2 states = s 3 s 4 s 5 Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 6 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Turn-based games s 0 G = ( S 1 , S 2 , s init , E ) S = S 1 ∪ S 2 , S 1 ∩ S 2 = ∅ , E ⊆ S × S s 1 s 2 P 1 states = P 2 states = Play π = s 0 s 1 s 2 . . . s n . . . s.t. s 0 = s init s 3 Prefix ρ = π ( n ) = s 0 s 1 s 2 . . . s n s 4 s 5 Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 6 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Pure strategies s 0 Pure strategy for P i λ i ∈ Λ i : Prefs i ( G ) → S s.t. for all ρ ∈ Prefs i ( G ), (Last( ρ ) , λ i ( ρ )) ∈ E s 1 s 2 Memoryless strategy λ pm ∈ Λ PM : S i → S i i Finite-memory strategy s 3 λ fm ∈ Λ FM : Prefs i ( G ) → S , and can i i be encoded as a deterministic Moore machine s 4 s 5 Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 6 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Integer payoff function s 0 − 2 2 G = ( S 1 , S 2 , s init , E , w ) w : E → Z s 1 s 2 0 1 3 1 s 3 − 2 0 s 4 s 5 Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 6 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Integer payoff function s 0 − 2 2 G = ( S 1 , S 2 , s init , E , w ) w : E → Z s 1 s 2 0 1 Energy level EL( ρ ) = � i = n − 1 3 1 w ( s i , s i +1 ) i =0 Mean-payoff s 3 MP( π ) = lim inf n →∞ 1 n EL( π ( n )) − 2 0 s 4 s 5 Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 6 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Energy and mean-payoff objectives s 0 Energy objective − 2 2 Given initial credit v 0 ∈ N , PosEnergy G ( v 0 ) = { π ∈ Plays( G ) | s 1 s 2 0 1 ∀ n ≥ 0 : v 0 + EL( π ( n )) ∈ N } 3 1 Mean-payoff objective Given threshold v ∈ Q , s 3 MeanPayoff G ( v ) = { π ∈ Plays( G ) | MP( π ) ≥ v } − 2 0 s 4 s 5 Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 6 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Energy and mean-payoff objectives s 0 λ 1 ( s 3 ) = s 4 − 2 2 ⊲ λ 1 wins for MeanPayoff G ( − 1 4 ) s 1 s 2 0 1 ⊲ λ 1 loses for PosEnergy G ( v 0 ), for any arbitrary high initial credit 3 1 λ 1 ( s 3 ) = s 5 ⊲ λ 1 wins for MeanPayoff G ( 1 2 ) s 3 ⊲ λ 1 wins for PosEnergy G ( v 0 ), with v 0 = 2 − 2 0 s 4 s 5 Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 6 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Decision problems Unknown initial credit problem : ∃ ? v 0 ∈ N , λ 1 ∈ Λ 1 s.t. λ 1 wins for PosEnergy G ( v 0 ) Mean-payoff threshold problem : Given v ∈ Q , ∃ ? λ 1 ∈ Λ 1 s.t. λ 1 wins for MeanPayoff G ( v ) MPG threshold v problem equivalent to EG − v unknown initial credit problem [BFL + 08]. Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 7 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Complexity of EGs and MPGs EGs MPGs Memory to win memoryless memoryless [CdAHS03, BFL + 08] [EM79, LL69] Decision problem NP ∩ coNP NP ∩ coNP Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 8 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion 1 Classical energy and mean-payoff games 2 Extensions to multi-dimensions and parity 3 Memory bounds 4 Strategy synthesis 5 Randomization as a substitute to finite-memory 6 Conclusion and ongoing work Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 9 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Multi-dimensional weights s 0 G = ( S 1 , S 2 , s init , E , w ) − 2 2 w : E → Z s 1 s 2 0 1 3 1 s 3 − 2 0 s 4 s 5 Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 10 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Multi-dimensional weights s 0 G = ( S 1 , S 2 , s init , E , k , w ) (2 , 1) (1 , − 2) w : E → Z k (0 , 0) s 1 s 2 (1 , 0) ⊲ multiple quantitative aspects (0 , − 2) ( − 3 , 3) ⊲ natural extensions of energy and mean-payoff objectives and associated s 3 decision problems (0 , 1) (1 , − 1) s 4 s 5 Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 10 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion MEGs & MMPGs Finite memory suffice for MEGs [CDHR10]. Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 11 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion MEGs & MMPGs Finite memory suffice for MEGs [CDHR10]. However, infinite memory is needed for MMPGs, even with only one player! [CDHR10] (2 , 0) (0 , 2) (0 , 0) s 0 s 1 (0 , 0) ⊲ To obtain MP( π ) = (1 , 1), P 1 has to visit s 0 and s 1 for longer and longer intervals before jumping from one to the other. ⊲ Any finite-memory strategy induces an ultimately periodic play s.t. MP( π ) = ( x , y ), x + y < 2. ⊲ With lim sup as MP the gap is huge : (2 , 2). Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 11 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion MEGs & MMPGs If players are restricted to finite memory [CDHR10], ⊲ MEGs and MMPGs are still determined and they are log-space equivalent, ⊲ the unknown initial credit and the mean-payoff threshold problems are coNP-complete, ⊲ no clue on memory bounds for P 1 (for P 2 , we know it is memoryless). Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 12 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion MEGs & MMPGs If players are restricted to finite memory [CDHR10], ⊲ MEGs and MMPGs are still determined and they are log-space equivalent, ⊲ the unknown initial credit and the mean-payoff threshold problems are coNP-complete, ⊲ no clue on memory bounds for P 1 (for P 2 , we know it is memoryless). Other interesting results on decision problems on MEGs are proved in [FJLS11]. Surprisingly, given a fixed initial vector, the problem becomes EXPSPACE-hard. Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 12 / 42

EGs & MPGs Multi-dim. & parity Mem. bounds Synthesis Randomization Conclusion Parity s 0 G = ( S 1 , S 2 , s init , E , w ) − 2 2 s 1 s 2 0 1 3 1 s 3 − 2 0 s 4 s 5 Strat. Synth. for Multi Quant. Obj. Chatterjee, Randour, Raskin 13 / 42