Proposes turn-based probabilistic timed multi-player games and adapts digital clocks reduction to compute reachability probability and expected price for targets.
Now, from the construction of Probσε , see [31], it is sufficient to show that: Probσε (π) = Probσ([π]−1 ε ) for all π∈ FPathsσε (1) which we prove by induction on the length of π
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Verification and Control of Turn-Based Probabilistic Real-Time Games
Proposes turn-based probabilistic timed multi-player games and adapts digital clocks reduction to compute reachability probability and expected price for targets.