On Communicating Finite-State Machines
Journal of the ACM (JACM)
Quasi-Static Scheduling of Embedded Software Using Equal Conflict Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
Schedulability Analysis of Petri Nets Based on Structural Properties
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Journal of Computer and System Sciences
Quasi-static scheduling of independent tasks for reactive systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Quasi-static scheduling of communicating tasks
Information and Computation
Applying step coverability trees to communicating component-based systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Step coverability algorithms for communicating systems
Science of Computer Programming
| Hi-index | 0.00 |
Good scheduling policies for distributed embedded applications are required for meeting hard real time constraints and for optimizing the use of computational resources. We study the quasi-static schedulingproblem in which (uncontrollable) control flow branchings can influence scheduling decisions at run time. Our abstracted task model consists of a network of sequential processes that communicate via point-to-point buffers. In each round, the task gets activated by a request from the environment. When the task has finished computing the required responses, it reaches a pre-determined configuration and is ready to receive a new request from the environment. For such systems, we prove that determining existence of quasi-static scheduling policies is undecidable. However, we show that the problem is decidable for the important sub-class of "data branching" systems in which control flow branchings are due exclusively to data-dependent internal choices made by the sequential components. This decidability result--which is non-trivial to establish--exploits ideas derived from the Karp and Miller coverability tree [8] as well as the existential boundedness notion of languages of message sequence charts [6].