Algebraic system analysis of timed Petri nets

We show that Continuous Timed Petri Nets (CTPN) can be modeled by generalized polynomial recurrent equations in the (min,+) semiring. We establish a correspondence between CTPN and Markov decision processes. We survey the basic system theoretical results available: behavioral (inputoutput) properties, algebraic representations, asymptotic regime. A particular attention is paid to the subclass of stable systems (with asymptotic linear growth).