Expressiveness and analysis of Delayable Timed Petri Net*

We consider an extension of Timed Petri Nets “à la Ramchandani” where the transitions are partitioned into delayable and non-delayable which has proven to be suitable for design synchronous circuits. For this model called Delayable Net (DTPN), firing delay a transition is strict whereas can miss its delay. Since delays natural numbers, studied as discrete time model.We deal with expressiveness DTPN by comparison well known Merlin's Time fire in interval. show that strictly more expressive w.r.t. weak timed bisimilarity than under discrete-time semantics. then symbolic reachability analysis DTPN, we complexity successor state computation O(n). In addition, propose reduction number edges explore preserves markings sequences. The space exploration implemented prototype tool, evaluated on classical TPN problem circuit application.