Name
Abstract | ||
|---|---|---|
In this article, we introduce a probabilistic verification algorithm for stochastic regular expressions over a probabilistic extension of the Action based Computation Tree Logic (ACTL*). The main results include a novel model checking algorithm and a semantics on the probabilistic action logic for stochastic regular expressions (SREs). Specific to our model checking algorithm is that SREs are defined via local probabilistic functions. Such functions are beneficial since they enable to verify properties locally for sub-components. This ability provides a flexibility to reuse the local results for the global verification of the system; hence, the framework can be used for iterative verification. We demonstrate how to model a system with an SRE and how to verify it with the probabilistic action based logic and present a preliminary performance evaluation with respect to the execution time of the reachability algorithm. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.3233/FI-2021-2018 | FUNDAMENTA INFORMATICAE |
Keywords | DocType | Volume |
quantitative verification, probabilistic verification, formal models, stochastic regular expressions, probabilistic regular expressions, stochastic algebra, action based logic | Journal | 179 |
Issue | ISSN | Citations |
2 | 0169-2968 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sinem Getir Yaman | 1 | 0 | 0.34 |
| Esteban Pavese | 2 | 0 | 0.34 |
| Lars Grunske | 3 | 1505 | 73.07 |