English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Fairness, Computable Fairness and Randomness

Jaeger, M. (1999). Fairness, Computable Fairness and Randomness. In M. Kwiatkowska (Ed.), Proceedings of the 2nd International Workshop on Probabilistic Methods in Verification (PROBMIV-99) (pp. 57-66). Birmingham: School of Computer Science, University of Birmingham.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-364C-9 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-364D-7
Genre: Conference Paper

Files

show Files
hide Files
:
PROBMIV99.ps.gz (Any fulltext), 68KB
 
File Permalink:
-
Name:
PROBMIV99.ps.gz
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/gzip
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-
:
probmiv99.ps (Any fulltext), 167KB
 
File Permalink:
-
Name:
probmiv99.ps
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/postscript
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Jaeger, Manfred1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: Motivated by the observation that executions of a probabilistic system almost surely are fair, we interpret concepts of fairness for nondeterministic processes as partial descriptions of probabilistic behavior. We propose computable fairness as a very strong concept of fairness, attempting to capture all the qualitative properties of probabilistic behavior that we might reasonably expect to see in the behavior of a nondeterministic system. It is shown that computable fairness does describe probabilistic behavior by proving that runs of a probabilistic system almost surely are computable fair. We then turn to the question of how sharp an approximation of randomness is obtained by computable fairness by discussing completeness of computable fairness for certain classes of path properties.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121999
 Publication Status: Issued
 Pages: -
 Publishing info: Birmingham : School of Computer Science, University of Birmingham
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519757
Other: Local-ID: C1256104005ECAFC-21ED7872A37ABC3FC125688F00626135-Jaeger99
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Eindhoven, the Netherlands
Start-/End Date: 1999

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 2nd International Workshop on Probabilistic Methods in Verification (PROBMIV-99)
Source Genre: Proceedings
 Creator(s):
Kwiatkowska, Marta, Editor
Affiliations:
-
Publ. Info: Birmingham : School of Computer Science, University of Birmingham
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 57 - 66 Identifier: -

Source 2

show
hide
Title: Technical Report CSR-99-8
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -