Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Performability Analysis: Measures, an Algorithm, and a Case Study
IEEE Transactions on Computers - Fault-Tolerant Computing
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Queueing networks—exact computational algorithms: a unified theory based on decomposition and aggregation
Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Bisimulation through probabilistic testing
Information and Computation
Stochastic Automata Network of Modeling Parallel Systems
IEEE Transactions on Software Engineering
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
An operational semantics for timed CSP
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Property specification patterns for finite-state verification
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
State-space support for path-based reward variables
IPDS '98 Proceedings of the third IEEE international performance and dependability symposium on International performance and dependability symposium
Automated compositional Markov chain generation for a plain-old telephone system
Science of Computer Programming
Compositional performance modelling with the TIPPtool
Performance Evaluation - Special issue on modelling techniques and tools for performance evaluation
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Process algebra for performance evaluation
Theoretical Computer Science
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Communication and Concurrency
Lectures on formal methods and performance analysis: first EEF/Euro summer school on trends in computer science
Markovian models for performance and dependability evaluation
Lectures on formal methods and performance analysis
Process algebra and Markov chains
Lectures on formal methods and performance analysis
Modelling with Generalized Stochastic Petri Nets
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
Faster and Symbolic CTMC Model Checking
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
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
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
An Algebra-Based Method to Associate Rewards with EMPA Terms
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On the Logical Characterisation of Performability Properties
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Model Checking Continuous-Time Markov Chains by Transient Analysis
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Stochastic Activity Networks: Structure, Behavior, and Application
International Workshop on Timed Petri Nets
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
A study of shared-memory mutual exclusion protocols using CADP
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Modeling and analyzing mobile software architectures
EWSA'06 Proceedings of the Third European conference on Software Architecture
Simulation for interactive markov chains
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Science of Computer Programming
| Hi-index | 0.00 |
Markov chains are widely used in practice to determine system performance and reliability characteristics. The vast majority of applications considers continuous-time Markov chains (CTMCs). This tutorial paper shows how successful model specification and analysis techniques from concurrency theory can be applied to performance evaluation. The specification of CTMCs is supported by a stochastic process algebra, while the quantitative analysis of these models is tackled by means of model checking. Process algebra provides: (i) a high-level specification formalism for describing CTMCs in a precise, modular and constraint-oriented way, and (ii) means for the automated generation and aggregation of CTMCs. Temporal logic model checking provides: (i) a formalism to specify complex measures-of-in terest in a lucid, compact and flexible way, (ii) automated means to quantify these measures over CTMCs, and (iii) automated measure-driven aggregation (lumping) of CTMCs. Combining process algebra and model checking constitutes a coherent framework for performance evaluation based on CTMCs.