Probabilistic approximation of runtime quantitative verification in self-adaptive systems
Authors:
- Mehran Alidoost NiaMNMehran Alidoost Nia
- Mehdi KargahiMKMehdi Kargahi
- Fathiyeh FaghihFFFathiyeh Faghih
- 1 February 2020
- journal article
- research article
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 72
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context2017
- Data-Efficient Bayesian Verification of Parametric Markov Chains2016
- A survey on engineering approaches for self-adaptive systemsPervasive and Mobile Computing, 2015
- Bisimulation equivalence and regularity for real-time one-counter automataJournal of Computer and System Sciences, 2014
- Approximation Metrics Based on Probabilistic Bisimulations for General State-Space Markov Processes: A SurveyElectronic Notes in Theoretical Computer Science, 2013
- Self-adaptive systems: A survey of current approaches, research challenges and applicationsExpert Systems with Applications, 2013
- Self-adaptive software needs quantitative verification at runtimeCommunications of the ACM, 2012
- PARAM: A Model Checker for Parametric Markov Models2010
- On Choosing and Bounding Probability MetricsInternational Statistical Review, 2002
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972