Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Statecharts: A visual formalism for complex systems
Science of Computer Programming
A Measure of Guaranteed Availability and its Numerical Evaluation
IEEE Transactions on Computers
The PEPA workbench: a tool to support a process algebra-based approach to performance modelling
Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools
GreatSPN 1.7: graphical editor and analyzer for timed and stochastic Petri nets
Performance Evaluation - Special issue: performance modeling tools
The UltraSAN modeling environment
Performance Evaluation - Special issue: performance modeling tools
Performability modelling tools and techniques
Performance Evaluation
IEEE Spectrum
A compositional approach to performance modelling
A compositional approach to performance modelling
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Modeling and analysis of stochastic systems
Modeling and analysis of stochastic systems
On the verification of qualitative properties of probabilistic processes under fairness constraints
Information Processing Letters
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
Model checking
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)
Software reliability methods
Process algebra for performance evaluation
Theoretical Computer Science
Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets
Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets
Performance of Computer Communication Systems: A Model-Based Approach
Performance of Computer Communication Systems: A Model-Based Approach
Symbolic Model Checking
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
SPNP: Stochastic Petri Net Package
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
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
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Model Checking Continuous-Time Markov Chains by Transient Analysis
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Model Checking Performability Properties
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Towards Model Checking Stochastic Process Algebra
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Specifying Performance Measures for PEPA
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Model Checking CSL until Formulae with Random Time Bounds
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
On the Use of Model Checking Techniques for Dependability Evaluation
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Markov regenerative SPN with non-overlapping activity cycles
IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
Performance-Related Reliability Measures for Computing Systems
IEEE Transactions on Computers
Closed-Form Solutions of Performability
IEEE Transactions on Computers
On Evaluating the Performability of Degradable Computing Systems
IEEE Transactions on Computers
Systems and Software Verification: Model-Checking Techniques and Tools
Systems and Software Verification: Model-Checking Techniques and Tools
A fast algorithm for the transient reward distribution in continuous-time Markov chains
Operations Research Letters
Formal modeling and quantitative analysis of KLAIM-based mobile systems
Proceedings of the 2005 ACM symposium on Applied computing
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
Specification patterns for probabilistic quality properties
Proceedings of the 30th international conference on Software engineering
Model Checking of Infinite State Space Markov Chains by Stochastic Bounds
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
CSRL model checking with closed-form bounding distributions
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Model Checking Publish/Subscribe Notification for thinkteam ®
Electronic Notes in Theoretical Computer Science (ENTCS)
Stochastic model checking with stochastic comparison
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Towards model checking stochastic aspects of the thinkteam user interface
DSVIS'05 Proceedings of the 12th international conference on Interactive Systems: design, specification, and verification
Hi-index | 0.00 |
Markov chains (and their extensions with rewards) have been widely used to determine performance, dependability and performability characteristics of computer communication systems, such as throughput, delay, mean time to failure, or the probability to accumulate at least a certain amount of reward in a given time.Due to the rapidly increasing size and complexity of systems, Markov chains and Markov reward models are difficult and cumbersome to specify by hand at the state-space level. Therefore, various specification formalisms, such as stochastic Petri nets and stochastic process algebras, have been developed to facilitate the specification of these models at a higher level of abstraction. Uptill now, however, the specification of the measure-of-interest is often done in an informal and relatively unstructured way. Furthermore, some measures-of-interest can not be expressed conveniently at all.In this tutorial paper, we present a logic-based specification technique to specify performance, dependability and performability measures-ofinterest and show how for a given finite Markov chain (or Markov reward model) such measures can be evaluated in a fully automated way. Particular emphasis will be given to so-called path-based measures and hierarchically-specified measures. For this purpose, we extend so-called model checking techniques to reason about discrete- and continuous-time Markov chains and their rewards. We also report on the use of techniques such as (compositional) model reduction and measure-driven state-space generation to combat the infamous state space explosion problem.