Model-checking large structured Markov chains.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1670788 (Why is no real title available?)
- scientific article; zbMATH DE number 1670870 (Why is no real title available?)
- scientific article; zbMATH DE number 52336 (Why is no real title available?)
- scientific article; zbMATH DE number 1361121 (Why is no real title available?)
- scientific article; zbMATH DE number 729460 (Why is no real title available?)
- scientific article; zbMATH DE number 2080040 (Why is no real title available?)
- scientific article; zbMATH DE number 1538048 (Why is no real title available?)
- scientific article; zbMATH DE number 1786480 (Why is no real title available?)
- scientific article; zbMATH DE number 1884410 (Why is no real title available?)
- scientific article; zbMATH DE number 1445805 (Why is no real title available?)
- A logic for reasoning about time and reliability
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
- Depth-First Search and Linear Graph Algorithms
- Efficient computation and representation of large reachability sets for composed automata
- Graph-Based Algorithms for Boolean Function Manipulation
- Integrating synchronization with priority into a Kronecker representation
- Model-checking continuous-time Markov chains
- Process algebra for performance evaluation
- Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
- Reachability analysis based on structured representations
- Specification techniques for Markov reward models
- Structured analysis approaches for large Markov chains
- Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space
Cited in
(24)- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Computing bottom SCCs symbolically using transition guided reduction
- Stochastic Evaluation of Large Interdependent Composed Models Through Kronecker Algebra and Exponential Sums
- scientific article; zbMATH DE number 1864588 (Why is no real title available?)
- scientific article; zbMATH DE number 1786480 (Why is no real title available?)
- CSL model checking algorithms for QBDs
- Assisting the design of a groupware system - Model checking usability aspects of thinkteam
- Model checking interactive Markov chains
- Out of control: reducing probabilistic models by control-state elimination
- CSL Model Checking Algorithms for Infinite-State Structured Markov Chains
- scientific article; zbMATH DE number 1538048 (Why is no real title available?)
- Symbolic state-space exploration and numerical analysis of state-sharing composed models
- A compositional framework for Markov processes
- Tools and Algorithms for the Construction and Analysis of Systems
- Statistical probabilistic model checking with a focus on time-bounded properties
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Compositional model checking of product-form CTMCs
- Reachability analysis based on structured representations
- Distributed disk-based algorithms for model checking very large Markov chains
- Model Checking Interactive Markov Chains
- Matrix- and state space reduced procedures for the performance evaluation of large stochastic Petri nets.
- Structured analysis approaches for large Markov chains
- Tackling large state spaces in performance modelling
- Multilevel solutions for structured Markov chains
This page was built for publication: Model-checking large structured Markov chains.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400291)
