Stationary behavior of manufacturing systems modeled by timed weighted marked graphs

Time Petri nets are commonly used for modelling and analyzing embedded systems, assembly lines, and streaming applications. In this paper, a sub class of time Petri net named timed weighted marked graphs (TWMGs) are studied. Stationary throughput analysis of these TWMGs is an important step for checking throughput requirements of concurrent real-time applications and finding the best schedules. We proposed some important properties of TWMGs which are useful for designers or engineers to study the stationary throughput and solve the scheduling problem for practical usage.