Hybrid Petri nets have been extended to include general transitions that fire after a randomly distributed amount of time. With single one-shot transition the state space and evolution over time can be represented either as Parametric Location Tree or Stochastic Time Diagram . Recent work has shown both representations combined then allow multiple stochastic firings. This presents an algorithm ...

We define an extension of time Petri nets such that the time at which a transition can fire, also called its firing date, may be dynamically updated. Our extension provides two mechanisms for updating the timing constraints of a net. First, we propose to change the static time interval of a transition each time it is newly enabled; in this case the new time interval is given as a function of th...

The problem of finite completeness of categories of Petri nets is studied. Since Petri nets have finite products, the problem reduces to the issue of the existence of equalizers. We show that the categories of Petri nets with general and Winskel morphisms do not admit equalizers, and hence are not finitely complete. An important class of multiplicative Petri net morphisms is also identified. Th...

Petri nets are a powerful formalism for the specification and verification of concurrent and real-time systems. Real-time systems must be carefully verified because even a small failure in these systems can cause loss of human lives. For this purposes the time reachability analysis of Petri nets with incorporated time issue is more than suitable. The best known and probably the most used Petri ...

High-level Petri nets (evolutions of low-level Petri nets) are well suitable formalisms to represent complex data, which influence the behavior of distributed, concurrent systems. However, usual verification techniques such as model checking and testing remain an open challenge for both (i.e., low-level and high-level Petri nets) because of the state space explosion problem and test case select...