Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Modeling languages like UML use asynchronous communication but do not specify the order in which messages are received. A simple language for specifying such orders declaratively is proposed that ensures fair and bounded fair scheduling. Such scheduling specifications are then translated to Streett automata that accept only and all infinite runs satisfying the specification. Using the automaton as a scheduler guarantees fairness and allows to analyze schedulability using standard automata-theoretic algorithms. The formalism is extended to the case of an uncooperative environment by "fall-back" scheduling specifications when events required for progress are not provided by the environment.
['Jens Schönborn', 'Marcel Kyas']
I am writing a research paper on a idea A Theory of Bounded Fair Scheduling
[{"from": "human", "value": "I am writing a research paper on a idea A Theory of Bounded Fair Scheduling"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Modeling languages like UML use asynchronous communication but do not specify the order in which messages are received. A simple language for specifying such orders declaratively is proposed that ensures fair and bounded fair scheduling. Such scheduling specifications are then translated to Streett automata that accept only and all infinite runs satisfying the specification. Using the automaton as a scheduler guarantees fairness and allows to analyze schedulability using standard automata-theoretic algorithms. The formalism is extended to the case of an uncooperative environment by \"fall-back\" scheduling specifications when events required for progress are not provided by the environment."}]