Automatic verification of competitive stochastic systems

Chen, Taolue; Forejt, Vojtěch; Kwiatkowska, Marta; Parker, David; Simaitis, Aistis

doi:10.1007/s10703-013-0183-7

Cited by 99 publications

(93 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The behaviour of the system and controller players is given in terms of strategies σ S : N S → D(N C ) and σ C : N C → N S such that (n, σ S (n)) ∈ M S for all n ∈ N S and (n, σ C (n)) ∈ M C for all n ∈ N C . Any choice σ = (σ S , σ C ) of strategies turns the game into a Markov chain M σ = (N, n 0 , T ) in the standard fashion [8], with the probability distribution T (n) given by T (n) = σ S (n) for n ∈ N S and T (n)(σ C (n)) = 1 for n ∈ N C .…”

Section: The Simple Steering Problemmentioning

confidence: 99%

“…Specifically, we assume given a suitable lookahead L ∈ N such that the goal in each step is to find a minimum-cost controller strategy to avoid the error states for at least L steps, starting from the current state s. Note that, in this case, we can simply add up the costs of a play with no need for a discount factor. This problem can be formalized using the techniques developed in [8]. For the original game G S = (N, I, M, c) and the error states E, define the set of error nodes N e := {(s, i) | s ∈ E, i ∈ {0, 1}}, and consider the modified game G S,E,L,s = (N , I , M , c ) starting in s, where…”

Section: Runtime Verificationmentioning

confidence: 99%

“…To enable steering, we allow an explicit controller process who can use the channels both as a source of information (to try to determine the actual system state) and as a steering medium (by altering the channel contents). We then take a stochastic game view [8] of the system, where, in addition to a randomised player that deals with probabilistic transitions, we have:…”

Section: Introductionmentioning

confidence: 99%

“…In [8], a reward-based temporal logic and verification algorithms were proposed for turn-based stochastic games and implemented as an extension of PRISM [23].…”

Section: Introductionmentioning

confidence: 99%

“…A survey of results can be found in [5] and an overview of partially observable stochastic games in [4]. The majority of the work has been theoretical, and we are aware of only two implementations, GIST [6] for synthesis and PRISM-games for quantitative verification [8,23]. Our paper is the first to propose stochastic game techniques as a solution to quantitative runtime steering.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Towards Communication-Based Steering of Complex Distributed Systems

Dräger

Kwiatkowska

2012

Large-Scale Complex IT Systems. Development, Operation and Management

Self Cite

View full text Add to dashboard Cite

Abstract. Quantitative verification is an established automated technique that can ensure predictability and dependability of software systems which exhibit probabilistic behaviour. Since offline usage of quantitative verification is infeasible for large-scale complex systems that continuously adapt to the changing environment, quantitative runtime verification was proposed as an alternative. Using an illustrative case study of communicating, distributed probabilistic processes, we formulate the problem of quantitative steering, a runtime technique that involves system monitoring, prediction of future errors, and enforcement of system's behaviour away from the error states. We consider a communicationbased variant of steering where enforcement is achieved by modifying the contents of communication channels. Our approach is based on stochastic games, where one player is the system and the other players assume the role of the controller, and hence steering reduces to finding a controller strategy that meets the given quantitative goal. We discuss the solution to the quantitative steering problem and its extensions inspired by complex real-world scenarios.

show abstract

Section: The Simple Steering Problemmentioning

confidence: 99%

Section: Runtime Verificationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…In [8], a reward-based temporal logic and verification algorithms were proposed for turn-based stochastic games and implemented as an extension of PRISM [23].…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Towards Communication-Based Steering of Complex Distributed Systems

Dräger

Kwiatkowska

2012

Large-Scale Complex IT Systems. Development, Operation and Management

Self Cite

View full text Add to dashboard Cite

show abstract

Modeling and verification of trust and reputation systems

Aldini

2015

Security Comm Networks

View full text Add to dashboard Cite

Trust is a basic soft-security condition influencing interactive and\ud cooperative behaviors in online communities. Several systems and models have\ud been proposed to enforce and investigate the role of trust in the process of\ud favoring successful cooperations while minimizing selfishness and failure.\ud However, the analysis of their effectiveness and efficiency is a challenging\ud issue. This paper provides a formal approach to the design and verification of\ud trust infrastructures used in the setting of software architectures and computer\ud networks supporting online communities. The proposed framework encompasses a\ud process calculus of concurrent systems, a temporal logic for trust, and model\ud checking techniques. Both functional and quantitative aspects can be modeled and\ud analyzed, while several types of trust models can be integrated

show abstract

Partial and Conditional Expectations in Markov Decision Processes with Integer Weights

Piribauer

Baier

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The paper addresses two variants of the stochastic shortest path problem ("optimize the accumulated weight until reaching a goal state") in Markov decision processes (MDPs) with integer weights. The first variant optimizes partial expected accumulated weights, where paths not leading to a goal state are assigned weight 0, while the second variant considers conditional expected accumulated weights, where the probability mass is redistributed to paths reaching the goal. Both variants constitute useful approaches to the analysis of systems without guarantees on the occurrence of an event of interest (reaching a goal state), but have only been studied in structures with non-negative weights. Our main results are as follows. There are polynomial-time algorithms to check the finiteness of the supremum of the partial or conditional expectations in MDPs with arbitrary integer weights. If finite, then optimal weight-based deterministic schedulers exist. In contrast to the setting of non-negative weights, optimal schedulers can need infinite memory and their value can be irrational. However, the optimal value can be approximated up to an absolute error of ǫ in time exponential in the size of the MDP and polynomial in log(1/ǫ).

show abstract

Automatic verification of competitive stochastic systems

Cited by 99 publications

References 29 publications

Towards Communication-Based Steering of Complex Distributed Systems

Towards Communication-Based Steering of Complex Distributed Systems

Modeling and verification of trust and reputation systems

Partial and Conditional Expectations in Markov Decision Processes with Integer Weights

Contact Info

Product

Resources

About