Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 2 research declarations. Search 10,000 more complete Mathlib declarations.
2 results
Clear filtersCslib.FLP.FairScheduler.fairDeliverMsg_scheduleMsgs
Plain-language statement
The correctness of d.scheduleMsgs ps s under the assumption a.FairDeliverMsg d ps q.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.FLP.FairScheduler.flatten_fairSegs
Plain-language statement
Given an infinite sequence of non-empty finite executions of algorithm a, if all messages with destinations in ps that are in-flight at the beginning of each finite execution are delivered in that finite execution, then those finite executions can be concatenated into an infinite execution of a in which every process in ps is fair.
Source project: Lean Computer Science Library
Person-level attribution pending.