Protocol scheduling
From MaRDI portal
Publication:2145259
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 177824 (Why is no real title available?)
- Abstract behavior types: a foundation model for components and their composition
- Borel determinacy
- Exposing latent mutual exclusion by work automata
- Faster algorithms for mean-payoff games
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
- On the expressiveness of higher dimensional automata
- Positional strategies for mean payoff games
- Proper protocol
- Reo: a channel-based coordination model for component composition
- Synthesizing robust systems
Cited in
(3)
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)