About decisiveness of dynamic probabilistic models
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3646295 (Why is no real title available?)
- scientific article; zbMATH DE number 3543391 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 1956504 (Why is no real title available?)
- scientific article; zbMATH DE number 1956509 (Why is no real title available?)
- scientific article; zbMATH DE number 2038771 (Why is no real title available?)
- scientific article; zbMATH DE number 1759620 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Analyzing probabilistic pushdown automata
- Decisive Markov Chains
- Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
- Efficient analysis of probabilistic programs with an unbounded counter
- Model Checking Probabilistic Pushdown Automata
- On selective unboundedness of VASS
- Petri nets and regular languages
- Probabilistic grammars and automata
- The quasi-stationary behavior of quasi-birth-and-death processes
- Vector addition systems and regular languages
- Verification of probabilistic systems with faulty communication
- Verifying programs with unreliable channels
- When are stochastic transition systems tameable?
This page was built for publication: About decisiveness of dynamic probabilistic models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967335)