On the verification of qualitative properties of probabilistic processes under fairness constraints.
From MaRDI portal
Publication:2583540
DOI10.1016/S0020-0190(98)00038-6zbMath1078.68664MaRDI QIDQ2583540
Marta Kwiatkowska, Christel Baier
Publication date: 17 January 2006
Published in: Information Processing Letters (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (10)
Categorical foundations for randomly timed automata ⋮ On fairness and randomness ⋮ Liveness Reasoning with Isabelle/HOL ⋮ When are stochastic transition systems tameable? ⋮ Parametric probabilistic transition systems for system design and analysis ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ Unnamed Item ⋮ Fair Termination for Parameterized Probabilistic Concurrent Systems ⋮ Assisting the design of a groupware system - Model checking usability aspects of thinkteam ⋮ On the verification of qualitative properties of probabilistic processes under fairness constraints.
Cites Work
- Verification of multiprocess probabilistic protocols
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- Bisimulation through probabilistic testing
- A logic for reasoning about time and reliability
- Processes with probabilities, priority and time
- Probabilistic verification
- Reactive, generative, and stratified models of probabilistic processes
- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- Model checking of probabilistic and nondeterministic systems
- Reasoning with time and chance
- Termination of Probabilistic Concurrent Program
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the verification of qualitative properties of probabilistic processes under fairness constraints.
