scientific article; zbMATH DE number 1956507
From MaRDI portal
Publication:4417853
Recommendations
Cited in
(15)- Fair termination for parameterized probabilistic concurrent systems
- Liveness by Invisible Invariants
- Liveness Reasoning with Isabelle/HOL
- Time-bounded termination analysis for probabilistic programs with delays
- scientific article; zbMATH DE number 1834575 (Why is no real title available?)
- On the hardness of almost-sure termination
- A counter abstraction technique for verifying properties of probabilistic swarm systems
- Quantitative analysis under fairness constraints
- On the hardness of analyzing probabilistic programs
- Liveness of randomised parameterised systems under arbitrary schedulers
- Model checking and abstraction to the aid of parameterized systems (a survey)
- scientific article; zbMATH DE number 7376040 (Why is no real title available?)
- An inductive technique for parameterised model checking of degenerative distributed randomised protocols
- \(P^5\): planner-less proofs of probabilistic parameterized protocols
- Checking qualitative liveness properties of replicated systems with stochastic scheduling
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 Q4417853)