Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
97
Voted
SPIN
2004
Springer
104
views
Theoretical Computer Science
»
more
SPIN 2004
»
Using Fairness to Make Abstractions Work
15 years 8 months ago
Download
spinroot.com
Dragan Bosnacki, Natalia Ioustinova, Natalia Sidor
Real-time Traffic
SPIN 2004
|
Theoretical Computer Science
|
claim paper
Related Content
»
Transition predicate abstraction and fair termination
»
On Complete Primitives for Fairness
»
Program slices as an abstraction for cohesion measurement
»
Fair bandwidth allocation framework for heterogeneous multiradio Wireless Mesh Networks
»
FairTorrent bringing fairness to peertopeer systems
»
Rainbow Fair Queueing Fair Bandwidth Sharing Without PerFlow State
»
Abstract shade trees
»
Bounded Fairness
»
Work rhythms analyzing visualizations of awareness histories of distributed groups
more »
Post Info
More Details (n/a)
Added
02 Jul 2010
Updated
02 Jul 2010
Type
Conference
Year
2004
Where
SPIN
Authors
Dragan Bosnacki, Natalia Ioustinova, Natalia Sidorova
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision