Quantitative Analysis under Fairness Constraints
From MaRDI portal
Publication:3648696
DOI10.1007/978-3-642-04761-9_12zbMath1262.68102OpenAlexW1581628543MaRDI QIDQ3648696
Marcus Größer, Frank Ciesinski, Christel Baier
Publication date: 1 December 2009
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04761-9_12
Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
Compositional strategy synthesis for stochastic games with multiple objectives ⋮ Compositional probabilistic verification through multi-objective model checking ⋮ Foundations of probability-raising causality in Markov decision processes ⋮ A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time ⋮ Quantitative Multi-objective Verification for Probabilistic Systems
Cites Work
- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
- Probabilistic verification
- Modalities for model checking: Branching time logic strikes back
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Automata, logics, and infinite games. A guide to current research
- Model checking of probabilistic and nondeterministic systems
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
- Specifying Concurrent Program Modules
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Guarded commands, nondeterminacy and formal derivation of programs
- The complexity of probabilistic verification
- Termination of Probabilistic Concurrent Program
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Quantitative Analysis under Fairness Constraints
