Bounded fairness

DOI10.1007/B12001MaRDI QIDQ5305647zbMATH OpenOpenAlexFDO

Authors Nachum Dershowitz, D. N. Jayasimha, Seung Joon Park

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12001

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Progress under bounded fairness
• Event fairness and non-interleaving concurrency
• Stepwise development of fair distributed systems
• New perspectives on fairness.
• Defining fairness in reactive and concurrent systems

Cited in

(10)

• Fairness and communication-based semantics for session-typed languages
• Fairness for transactional events
• Balanced Paths in Colored Graphs
• Concurrent games and semi-random determinacy
• Progress under bounded fairness
• A Theory of Bounded Fair Scheduling
• Checking a Mutex Algorithm in a Process Algebra with Fairness
• Refinement of Timing Constraints for Concurrent Tasks with Scheduling
• Quantitatively fair scheduling
• Event fairness and non-interleaving concurrency

This page was built for publication: Bounded fairness

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