Quasi-static scheduling of communicating tasks

DOI10.1016/j.ic.2009.09.005zbMath1209.68060OpenAlexW1997611816MaRDI QIDQ1959479

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

Publication date: 7 October 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.09.005

zbMATH Keywords

channel boundcommunicating machinesquasi-static scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Automated verification of automata communicating via FIFO and bag buffers

Cites Work

• Unnamed Item
• Unnamed Item
• Testing for unboundedness of fifo channels
• The covering and boundedness problems for vector addition systems
• Parallel program schemata
• Quasi-Static Scheduling of Communicating Tasks
• On Communicating Finite-State Machines
• Tools and Algorithms for the Construction and Analysis of Systems
• Lectures on Concurrency and Petri Nets

This page was built for publication: Quasi-static scheduling of communicating tasks