A Theory of Bounded Fair Scheduling

DOI10.1007/978-3-540-85762-4_23zbMath1161.68583OpenAlexW2139277611MaRDI QIDQ5505612

Jens Schönborn, Marcel Kyas

Publication date: 27 January 2009

Published in: Theoretical Aspects of Computing - ICTAC 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85762-4_23

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Testing Concurrent Objects with Application-Specific Schedulers

Cites Work

• Unnamed Item
• Unnamed Item
• Creol: A type-safe object-oriented model for distributed concurrent systems
• Propositional dynamic logic of looping and converse is elementarily decidable
• Impossibility of distributed consensus with one faulty process

This page was built for publication: A Theory of Bounded Fair Scheduling