ABSTRACT
Abstract This chapter is devoted to the study of timed weighted event graphs, which constitute a subclass of Petri nets often considered for modeling embedded applications such as video encoders. Some basic recent mathematical properties are presented, leading to algorithms checking the liveness and computing the optimum throughput of these systems.
