ACM Transactions on Computer Systems (TOCS)
An analysis of stochastic shortest path problems
Mathematics of Operations Research
Nondeterministic polling systems
Management Science
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Beyond Memoryless Distributions: Model Checking Semi-Markov Chains
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Stochastic Activity Networks: Structure, Behavior, and Application
International Workshop on Timed Petri Nets
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Delayed Nondeterminism in Continuous-Time Markov Decision Processes
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Towards Performance Prediction of Compositional Models in Industrial GALS Designs
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
State Space Reduction of Linear Processes Using Control Flow Reconstruction
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis
IEEE Transactions on Dependable and Secure Computing
Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On Probabilistic Automata in Continuous Time
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Safety, Dependability and Performance Analysis of Extended AADL Models
The Computer Journal
SCOOP: A Tool for SymboliC Optimisations of Probabilistic Processes
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Model checking interactive markov chains
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Quantitative timed analysis of interactive markov chains
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
GSPNs Revisited: Simple Semantics and New Analysis Algorithms
ACSD '12 Proceedings of the 2012 12th International Conference on Application of Concurrency to System Design
Efficient modelling and generation of Markov automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
On the semantics of Markov automata
Information and Computation
| Hi-index | 0.00 |
Markov automata (MA) constitute an expressive continuous-time compositional modelling formalism. They appear as semantic backbones for engineering frameworks including dynamic fault trees, Generalised Stochastic Petri Nets, and AADL. Their expressive power has thus far precluded them from effective analysis by probabilistic (and statistical) model checkers, stochastic game solvers, or analysis tools for Petri net-like formalisms. This paper presents the foundations and underlying algorithms for efficient MA modelling, reduction using static analysis, and most importantly, quantitative analysis. We also discuss implementation pragmatics of supporting tools and present several case studies demonstrating feasibility and usability of MA in practice.