The effectiveness of Petri nets for the modelling of reactive systems is demonstrated through the use of a class of non-autonomous hierarchical high-level Petri nets, named by Hierarchical Reactive Petri Nets. The translation between the Petri net model and executable code is presented and shown to be simple and direct allowing a smooth two-way automatic translation process between specificatio...

Software engineering and Petri net theory are disciplines of different nature. Research on software engineering focuses on a problem domain, i.e., the development of complex software systems, and tries to find a coherent set of solutions to cope with the different aspects of the problem, while research on Petri nets investigates applications and properties of a specific model (Petri nets). When...

This work proposes an approach for course modeling using Petri nets. The proposed modeling method can be applied to support development of e-learning platforms (namely learning management systems LMS) allowing student guidance when considering reaching a specific goal. This goal could be as simple as getting a set of sequential courses (or a degree), or as complex as combining different modules...

The context of this work is the reconstruction of Petri net models for biological systems from experimental data. Such methods aim at generating all network alternatives tting the given data. To keep the solution set small while guaranteeing its completeness, the idea is to generate only Petri nets being minimal in the sense that all other networks tting the data contain the reconstructed ones....

Petri nets have become an effective formalism to model biological systems. However, attempts to simulate biological systems by low-level Petri nets are restricted to relatively small models, and they tend to grow quickly for modeling complex systems, which makes it more difficult to manage and understand the nets. Motivated by this, we propose a colored Petri net-based framework for modeling, s...

In this paper we tackle the decidability of marking reachability for a hybrid formalism based on Petri nets. The model we consider is the untimed version of First–Order Hybrid Petri Nets: it combines a discrete Petri net and a continuous Petri net, the latter being a fluid version of a usual discrete Petri net. It is suggested that the decidability results should be pursued exploiting a hierarc...

The behaviour of pure Petri nets (i.e. without side condition) is given by ordinary automata because all information about concurrency is encoded in the structure of the marking graphs. By contrast, the behaviour of (possibly) impure nets requires higher-dimensional automata: independence should in that case be made explicit. These higher-dimensional automata are step transition systems in the ...

High-level Petri nets make models more concise and readable as compared to low-level Petri nets. However, usual verification techniques such as state space analysis remain an open challenge for both because of state space explosion. The contribution of this paper is to propose an approach for property based reduction of the state space of Algebraic Petri nets (a variant of high-level Petri nets...

The behaviour of pure Petri nets (i.e. without side condition) is given by ordinary automata because all information about concurrency is encoded in the structure of the marking graphs. By contrast, the behaviour of (possibly) impure nets requires higher-dimensional automata: independence should in that case be made explicit. These higher-dimensional automata are step transition systems in the ...