Static scheduling of synchronous data flow programs for digital signal processing
IEEE Transactions on Computers
Free choice Petri nets
Software synthesis of process-based concurrent programs
DAC '98 Proceedings of the 35th annual Design Automation Conference
An MPEG-2 decoder case study as a driver for a system level design methodology
CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
Synthesis of embedded software using free-choice Petri nets
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
YAPI: application modeling for signal processing systems
Proceedings of the 37th Annual Design Automation Conference
Task generation and compile-time scheduling for mixed data-control embedded software
Proceedings of the 37th Annual Design Automation Conference
System level design with spade: an M-JPEG case study
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
False Path Elimination in Quasi-Static Scheduling
Proceedings of the conference on Design, automation and test in Europe
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
Hi-index | 0.00 |
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterministic choices. Schedulability analysis for a given PN answers the question whether a schedule exists in the reachability space of this net. This paper suggests a novel approach for schedulability analysis based solely on PN structure. It shows that unschedulability can be caused by a structural relation among transitions modelling nondeterministic choices. A method based on linear programming for checking this relation is proposed. This paper also presents a necessary condition for schedulability based on the rank of the incidence matrix of the underlying PN. These results shed a light on the sources of unschedulability often found in PN models of embedded multimedia systems.