Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation 2013
DOI: 10.1145/2486092.2486124
|View full text |Cite
|
Sign up to set email alerts
|

Simulation-based verification of hybrid automata stochastic logic formulas for stochastic symmetric nets

Abstract: The Hybrid Automata Stochastic Logic (HASL) has been recently defined as a flexible way to express classical performance measures as well as more complex, path-based ones (generically called "HASL formulas"). The considered paths are executions of Generalized Stochastic Petri Nets (GSPN), which are an extension of the basic Petri net formalism to define discrete event stochastic processes. The computation of the HASL formulas for a GSPN model is demanded to the COSMOS tool, that applies simulation techniques t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
1
1
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 20 publications
0
6
0
Order By: Relevance
“…Stochastic logics for CTMCs define formulas of the type Prob α (ϕ) that are satisfied by a CTMC if the probability of the set of executions of the CTMC that satisfy the constraints ϕ is α. The most well-known of the stochastic logics is CSL [7], that, in the desire to limit the cost of the model-checking, trades simplicity of ϕ for efficiency, resulting in a logic that is not adequate for passage time computation [4].…”
Section: Use Of Cslta For Sla Computationmentioning
confidence: 99%
See 3 more Smart Citations
“…Stochastic logics for CTMCs define formulas of the type Prob α (ϕ) that are satisfied by a CTMC if the probability of the set of executions of the CTMC that satisfy the constraints ϕ is α. The most well-known of the stochastic logics is CSL [7], that, in the desire to limit the cost of the model-checking, trades simplicity of ϕ for efficiency, resulting in a logic that is not adequate for passage time computation [4].…”
Section: Use Of Cslta For Sla Computationmentioning
confidence: 99%
“…The relationship between passage time and stochastic logics has been investigated in [4], in the context of HASL (Hybrid Automata Stochastic Logic) [10]. HASL allows very complicated properties to be expressed as Prob α (H), where H is an Hybrid Automata.…”
Section: Use Of Cslta For Sla Computationmentioning
confidence: 99%
See 2 more Smart Citations
“…Accuracy comparison. To assess the accuracy of COSMOS we compared its output with the one produced by PRISM via both its numerical engine (PRISM-n) and its statistical engine (PRISM-s) 5 : results indicate that COSMOS and PRISM-s are comparably accurate with the estimated intervals always containing the (actual) value obtained with the numerical engine of PRISM. Using the value computed by the numerical engine of PRISM, we perform a coverage test of COSMOS: we compute the ratio of simulations that return a confidence interval which contains the real value.…”
Section: Tqs Experiments With Sequential Hypothesis Testingmentioning
confidence: 99%