Petri nets have been widely used to model and analyze biochemical reaction networks. This chapter gives an overview of di↵erent types of Petri nets within a unifying Petri net framework that comprises the qualitative, stochastic, continuous and hybrid paradigms at both uncolored and colored levels. The Petri net framework permits to investigate one and the same biological reaction network with ...

A Markovian Petri net is a stochastic discrete event system frequently used for analysis and performance evaluation purposes. In the past, the fluidification has been proposed as a relaxation technique for avoiding the ”state explosion problem”. Following the same approach, in this paper a hybrid Petri net model is defined as a partial relaxation of an original Markovian Petri net. It is shown ...

We present two tools, MPath2PN and CoMeta, which are part of an ongoing project for representing and comparing metabolic pathways as Petri Nets. MPath2PN is intended to support an automatic translation of metabolic pathways from the major biological databases into corresponding Petri nets expressed in the input formalisms for Petri net tools. CoMeta is devised to compare metabolic pathways of d...

A Petri net controlled grammar is a context-free grammar equipped with a Petri net, whose transitions are labeled with rules of the grammar or the empty string, and the associated language consists of all terminal strings which can be derived in the grammar and the the sequence of rules in every terminal derivation corresponds to some occurrence sequence of transitions of the Petri net which is...

Modern window-based user interfaces are actually a special kind of reactive system, and Petri nets may be fruitfully used to design such user computer dialogues. This paper describes a software engineering tool aimed at supporting the use of high-level Petri nets for the specification, design and implementation of user interfaces in an event-driven interface system. We assess the rationale for ...

We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as conflict-free, BPP, normal Petri nets and more. A new decomposition approach is applied to developing an integer linear programming formulation for characterizing the reachability sets of such Petri nets. Consequentl...

A finite word is called Petri net solvable if it is isomorphic to the reachability graph of some unlabelled Petri net. In this paper, the class of two-letter Petri net solvable words is studied.

This contribution discusses the application of Petri nets for modeling workflow in healthcare based on a normative language approach. After a brief introduction, a framework of different abstraction levels covering clinical workflow representation to workflow implementation is presented. In order to use the object Petri nets formalism for clinical workflow representation at the conceptual level...

Message Sequence Chart (MSC) is a graphical trace language for describing the communication behaviour of distributed systems. In order to build a Petri Net model of a complex system, this paper introduces a strategy to build a Petri Net model by using MSC. The algorithm of translating the MSC model to Petri Net model is also given in this paper. We can get the Petri Net model and improve it by ...

This paper presents a Petri net based analysis of ontology for indoor location-based services. The proposed method builds up a Petri net model for the given ontology at the first step. Then, it analyzes the Petri net model by running the simulation on it. The proposed method of building a Petri net model for the given ontology is given in the paper. Then algorithms of performing inferences on t...