On the verification of qualitative properties of probabilistic processes under fairness constraints.

DOI10.1016/S0020-0190(98)00038-6MaRDI QIDQ2583540zbMATH OpenFDO

Authors Christel Baier, Marta Kwiatkowska

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

VerificationFairnessProbabilistic processes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 7280017
• New perspectives on fairness.
• Quantitative analysis under fairness constraints
• Defining fairness in reactive and concurrent systems
• On fairness and randomness

Cites work

• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 3735115 (Why is no real title available?)
• scientific article; zbMATH DE number 176728 (Why is no real title available?)
• scientific article; zbMATH DE number 1231591 (Why is no real title available?)
• scientific article; zbMATH DE number 1318512 (Why is no real title available?)
• A logic for reasoning about time and reliability
• Bisimulation through probabilistic testing
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Model checking of probabilistic and nondeterministic systems
• On the verification of qualitative properties of probabilistic processes under fairness constraints.
• Probabilistic verification
• Processes with probabilities, priority and time
• Reactive, generative, and stratified models of probabilistic processes
• Reasoning with time and chance
• Termination of Probabilistic Concurrent Program
• Verification of multiprocess probabilistic protocols

Cited in

(16)

• Quantitative analysis under fairness constraints
• Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
• Theoretical Aspects of Computing – ICTAC 2005
• On the verification of qualitative properties of probabilistic processes under fairness constraints.
• Separable GPL: decidable model checking with more non-determinism
• Assisting the design of a groupware system - Model checking usability aspects of thinkteam
• Parametric probabilistic transition systems for system design and analysis
• When are stochastic transition systems tameable?
• Sound approximate and asymptotic probabilistic bisimulations for PCTL
• Defining fairness in reactive and concurrent systems
• Fair termination for parameterized probabilistic concurrent systems
• Liveness Reasoning with Isabelle/HOL
• Categorical foundations for randomly timed automata
• Concurrency, σ-Algebras, and Probabilistic Fairness
• New perspectives on fairness.
• On fairness and randomness

This page was built for publication: On the verification of qualitative properties of probabilistic processes under fairness constraints.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583540)