scientific article; zbMATH DE number 1759620
From MaRDI portal
Publication:4536611
Recommendations
Cited in
(19)- Simulating perfect channels with probabilistic lossy channels
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems
- Quantitative analysis of probabilistic lossy channel systems
- Model checking probabilistic systems
- Decidability of Parameterized Probabilistic Information Flow
- Termination Problems in Chemical Kinetics
- Branching-time model-checking of probabilistic pushdown automata
- scientific article; zbMATH DE number 1735960 (Why is no real title available?)
- scientific article; zbMATH DE number 1956509 (Why is no real title available?)
- Undecidable verification problems for programs with unreliable channels
- Branching-time model-checking of probabilistic pushdown automata
- Validation of Stochastic Systems
- Decisive Markov Chains
- Stochastic Games with Lossy Channels
- scientific article; zbMATH DE number 2242597 (Why is no real title available?)
- Undecidable verification problems for programs with unreliable channels
- About decisiveness of dynamic probabilistic models
- Regular model checking for systems with effectively regular reachability relation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536611)