Quasi-Static Scheduling of Communicating Tasks

DOI10.1007/978-3-540-85361-9_26zbMath1160.68463OpenAlexW1931515601MaRDI QIDQ3541026

Blaise Genest, Shaofa Yang, P. S. Thiagarajan, Philippe Darondeau

Publication date: 25 November 2008

Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_26

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Step coverability algorithms for communicating systems ⋮ Quasi-static scheduling of communicating tasks

This page was built for publication: Quasi-Static Scheduling of Communicating Tasks