2015
DOI: 10.1007/978-3-319-15545-6_30
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic Model Checking of the Stochastic Quality Calculus

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…However, the stochastic behaviour (Exp distributed) and the real time behaviour (Dirac distributed) can often be split into a pure stochastic behaviour (Exp distributed) in the form of a Continuous Time Markov Chain [23] and a pure real time behaviour (Dirac distributed) embodied in a query in Continuous Stochastic Logic [24]. These ideas are developed in [26].…”
Section: Theorem 3 the Semantics Of Systems In The Stochastic Qualitmentioning
confidence: 99%
“…However, the stochastic behaviour (Exp distributed) and the real time behaviour (Dirac distributed) can often be split into a pure stochastic behaviour (Exp distributed) in the form of a Continuous Time Markov Chain [23] and a pure real time behaviour (Dirac distributed) embodied in a query in Continuous Stochastic Logic [24]. These ideas are developed in [26].…”
Section: Theorem 3 the Semantics Of Systems In The Stochastic Qualitmentioning
confidence: 99%
“…The case in point here is whether a service endpoint providing a service can continue to maintain the robustness of that service if larger and larger numbers of attackers threaten to overwhelm the server. This sentiment has been expressed very well in [2] where the authors write: "We believe that with quantitative information on the robustness, it will be possible to better determine whether or not the software continues to deal appropriately with risks and threats as their application environment changes." To analyse these problems in large-scale systems we need to use scalable modelling methods.…”
Section: Introductionmentioning
confidence: 99%
“…The use of array notation syntax in PEPA (say, for example, P [2]) indicates a PEPA component array, which is syntactic sugar for P P , which is itself syntactic sugar for P L P when L, the cooperation set, is ∅ (meaning the empty set, as usual).…”
Section: First Model: Server and Clients Onlymentioning
confidence: 99%
“…The work of D'Argenio inspired the Modest language, which operates with stochastic timed automata (STA) [6] and is supported by the Modest Toolset [16]. Lately, Zeng, Nielson and Nielson proposed the stochastic quality calculus SQC [22] as an intriguing formalism to reason about distributed systems with broadcast communication.…”
Section: Introductionmentioning
confidence: 99%