Protocol scheduling
DOI10.1007/978-3-030-89247-0_1zbMATH Open1496.68097OpenAlexW4241096898MaRDI QIDQ2145259FDOQ2145259
Publication date: 17 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-89247-0_1
Recommendations
Formal languages and automata (68Q45) Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Reo: a channel-based coordination model for component composition
- Borel determinacy
- On the expressiveness of higher dimensional automata
- Positional strategies for mean payoff games
- Synthesizing robust systems
- Title not available (Why is that?)
- Abstract behavior types: a foundation model for components and their composition
- Faster algorithms for mean-payoff games
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
- Exposing latent mutual exclusion by work automata
- Proper protocol
Cited In (3)
Uses Software
This page was built for publication: Protocol scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145259)