Weakly strong semantics of Time Petri Nets for performance evaluations
Jan Komenda, Sébastien Lahaye, Rémi Parrot, Olivier Henri Roux · IFAC-PapersOnLine · 2024
We propose two new semantics for T-time Petri nets (T-TPN), which fill the gap between strong and weak semantics. By encoding a 2-counter machine, we prove that reachability is not decidable for these semantics in the case of unbounded nets. We then consider safe nets and we propose a translation into interval weighted automata over an interval like semiring, product of (max,+) semiring with itself, that preserves the timed behavior of T-TPN.