Symbolic model checking for probabilistic processes
From MaRDI portal
Recommendations
- Symbolic model checking for factored probabilistic models
- scientific article; zbMATH DE number 1538049
- Symbolic model checking for probabilistic timed automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Model Checking Software
- Model checking probabilistic systems
- Model checking of probabilistic and nondeterministic systems
- scientific article; zbMATH DE number 2080040
Cites work
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 176728 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- scientific article; zbMATH DE number 910726 (Why is no real title available?)
- A logic for reasoning about time and reliability
- A probabilistic PDL
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Bisimulation through probabilistic testing
- Generating BDDs for symbolic model checking in CCS
- Graph-Based Algorithms for Boolean Function Manipulation
- Iteration theories of synchronization trees
- Model checking of probabilistic and nondeterministic systems
- Symbolic model checking: \(10^{20}\) states and beyond
- Termination of Probabilistic Concurrent Program
- The complexity of probabilistic verification
- Verification of multiprocess probabilistic protocols
Cited in
(49)- Applying Formal Methods: Testing, Performance, and M/E-Commerce
- Three-valued abstraction for probabilistic systems
- Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement
- scientific article; zbMATH DE number 1538049 (Why is no real title available?)
- scientific article; zbMATH DE number 1864589 (Why is no real title available?)
- Parameter synthesis for Markov models: covering the parameter space
- Measuring progress of probabilistic LTL model checking
- Theoretical Aspects of Computing - ICTAC 2004
- Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
- Symbolic verification and strategy synthesis for turn-based stochastic games
- Metrics for labelled Markov processes
- Counterexample generation for discrete-time Markov models: an introductory survey
- Towards classifying propositional probabilistic logics
- Model checking probabilistic systems
- Approximating labelled Markov processes
- Synthesizing efficient systems in probabilistic environments
- Symbolic model checking for factored probabilistic models
- Preface to the special issue on probabilistic model checking
- Validation of Stochastic Systems
- Validation of Stochastic Systems
- Bayesian statistical model checking with application to Stateflow/Simulink verification
- Model checking with probabilistic tabled logic programming
- Lazy probabilistic model checking without determinisation
- A progress measure for explicit-state probabilistic model-checkers
- Automated Technology for Verification and Analysis
- Model checking linear-time properties of probabilistic systems
- System design of stochastic models using robustness of temporal properties
- Model Checking Stochastic Branching Processes
- Automatically finding the right probabilities in Bayesian networks
- scientific article; zbMATH DE number 2080040 (Why is no real title available?)
- scientific article; zbMATH DE number 2087806 (Why is no real title available?)
- Deciding bisimilarity and similarity for probabilistic processes.
- Compositional model checking of product-form CTMCs
- Minimization of probabilistic models of programs
- Verifying pCTL model checking
- Verification, Model Checking, and Abstract Interpretation
- Temporalization of Probabilistic Propositional Logic
- Symbolic dependency graphs for \(\mathrm {PCTL}^{>}_{\leq}\) model-checking
- On-the-fly probabilistic model checking
- Symbolic approaches to probability distributions in process algebra
- Data-Driven Invariant Learning for Probabilistic Programs
- On the use of model and logical embeddings for model checking of probabilistic systems
- Compositional probabilistic model checking with string diagrams of MDPs
- Probabilistic program verification via inductive synthesis of inductive invariants
- scientific article; zbMATH DE number 2079828 (Why is no real title available?)
- Approximate verification of the symbolic dynamics of Markov chains
- Efficient Algorithms for Omega-Regular Energy Games
- Model Checking Software
- Specification, testing and implementation relations for symbolic-probabilistic systems
This page was built for publication: Symbolic model checking for probabilistic processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571974)
