Rational series and their languages
Rational series and their languages
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
The complexity of probabilistic verification
Journal of the ACM (JACM)
Using JFLAP to interact with theorems in automata theory
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Probabilistic Reachability for Parametric Markov Models
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Time-bounded reachability in distributed input/output interactive probabilistic chains
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Run-time efficient probabilistic model checking
Proceedings of the 33rd International Conference on Software Engineering
Synthesis for PCTL in parametric Markov decision processes
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Model repair for probabilistic systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Systematic simplicity-accuracy tradeoffs in parameterised contract models
Proceedings of the joint ACM SIGSOFT conference -- QoSA and ACM SIGSOFT symposium -- ISARCS on Quality of software architectures -- QoSA and architecting critical systems -- ISARCS
QoS verification and model tuning @ runtime
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
PARAM: a model checker for parametric markov models
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Computing the leakage of information-hiding systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Evolution, adaptation, and the quest for incrementality
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Model-based verification of quantitative non-functional properties for software product lines
Information and Software Technology
An extension of the inverse method to probabilistic timed automata
Formal Methods in System Design
PROPOLIS: provisioned analysis of data-centric processes
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We present a language-theoretic approach to symbolic model checking of PCTL over discrete-time Markov chains. The probability with which a path formula is satisfied is represented by a regular expression. A recursive evaluation of the regular expression yields an exact rational value when transition probabilities are rational, and rational functions when some probabilities are left unspecified as parameters of the system. This allows for parametric model checking by evaluating the regular expression for different parameter values, for instance, to study the influence of a lossy channel in the overall reliability of a randomized protocol.