Model checking stochastic automata
DOI10.1145/937555.937558zbMATH Open1365.68316OpenAlexW2073841996MaRDI QIDQ5267439FDOQ5267439
John Derrick, Jeremy W. Bryans, Howard Bowman
Publication date: 13 June 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/937555.937558
Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (8)
- Extending Timed Process Algebra with Discrete Stochastic Time
- Categories of timed stochastic relations
- Model Checking Stochastic Branching Processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calculating Probabilities of Real-Time Test Cases
- The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator
- Title not available (Why is that?)
Recommendations
- Stochastic model checking π π
- Model Checking Stochastic Branching Processes π π
- Model Checking Probabilistic Pushdown Automata π π
- Model checking for probabilistic timed automata π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Model checking of probabilistic and nondeterministic systems π π
- Stochastic Model Checking of the Stochastic Quality Calculus π π
- Model Checking Probabilistic Systems π π
- Model Checking Software π π
This page was built for publication: Model checking stochastic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267439)