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

DOI10.1016/S0020-0190(98)00038-6zbMATH Open1078.68664MaRDI QIDQ2583540FDOQ2583540

Authors: Christel Baier, Marta Kwiatkowska 

Publication date: 17 January 2006

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

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

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)

Cites Work

• Bisimulation through probabilistic testing
• A logic for reasoning about time and reliability
• Model checking of probabilistic and nondeterministic systems
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reactive, generative, and stratified models of probabilistic processes
• Title not available (Why is that?)
• Processes with probabilities, priority and time
• Probabilistic verification
• Termination of Probabilistic Concurrent Program
• On the verification of qualitative properties of probabilistic processes under fairness constraints.
• Reasoning with time and chance
• Verification of multiprocess probabilistic protocols
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

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

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)