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...

In its basic version, Petri Nets are defined as fixed graphs, where the behaviour of the system is modelled as the marking of the graph which changes over time. This constraint makes the Petri Nets a poor tool to deal with reconfigurable systems as mobile computing systems, where the structure of the system can change as its behaviour, during time. Many extended Petri nets were proposed to deal...

Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [10]. Boundedness is EXPSPACE and liveness is EXPSPACE or worse for plain Petri nets [4]. However, for some restricted classes, e.g. for plain free-choice Petri nets, problems become more amenable to analysis. There is the polynomial time algorithm to check if ...

Petri nets are a formal, graphical and executable modeling technique for the specification and analysis of concurrent systems and have been widely applied in computer science and many other engineering disciplines. Low level Petri nets are simple and useful for modeling control flows; however, they are not powerful to define data and system functionality. High level Petri nets were developed to...