On place invariant sets and the rank of the incidence matrix of Petri nets

2002 ◽  
Author(s):  
P. Ramachandran ◽  
M. Kamath
Keyword(s):  
Petri Nets ◽  
Incidence Matrix ◽  
Invariant Sets

scholarly journals Computing Signal Transduction in Signaling Networks modeled as Boolean Networks, Petri Nets, and Hypergraphs

2018 ◽  
Author(s):  
Luis Sordo Vieira ◽  
Paola Vera-Licona
Keyword(s):  
Signal Transduction ◽  
Petri Nets ◽  
Intracellular Signaling ◽  
Incidence Matrix ◽  
Boolean Networks ◽  
Signaling Network ◽  
Signaling Networks ◽  
Signal Transduction Networks ◽  
Elementary Modes ◽  
Simple Paths

AbstractMathematical frameworks circumventing the need of mechanistic detail to build models of signal transduction networks include graphs, hypergraphs, Boolean Networks, and Petri Nets. Predicting how a signal transduces in a signaling network is essential to understand cellular functions and disease. Different formalisms exist to describe how a signal transduces in a given intracellular signaling network represented in the aforementioned modeling frameworks: elementary signaling modes, T-invariants, extreme pathway analysis, elementary flux modes, and simple paths. How do these formalisms compare?We present an overview of how signal transduction networks have been modelled using graphs, hypergraphs, Boolean Networks, and Petri Nets in the literature. We provide a review of the different formalisms for capturing signal transduction in a given model of an intracellular signaling network. We also discuss the existing translations between the different modeling frameworks, and the relationships between their corresponding signal transduction representations that have been described in the literature. Furthermore, as a new formalism of signal transduction, we show how minimal functional routes proposed for signaling networks modeled as Boolean Networks can be captured by computing topological factories, a methodology found in the metabolic networks literature. We further show that in the case of signaling networks represented with an acyclic B-hypergraph structure, the definitions are equivalent. In signaling networks represented as directed graphs, it has been shown that computations of elementary modes via its incidence matrix correspond to computations of simple paths and feedback loops. We show that computing elementary modes based on the incidence matrix of a B-hypergraph fails to capture minimal functional routes.

scholarly journals How to find Invariants for Coloured Petri Nets

1983 ◽  
Vol 9 (120) ◽  
Author(s):  
Kurt Jensen
Keyword(s):  
Petri Nets ◽  
Incidence Matrix ◽  
Coloured Petri Nets ◽  
Transformation Rules

This paper shows how invariants can be found for coloured Petri nets. We define a set of transformation rules, which can be used to transform the incidence-matrix, without changing the set of invariants.

Reachability analysis of logic Petri nets using incidence matrix

2013 ◽  
Vol 8 (6) ◽  
pp. 630-647 ◽  
Author(s):  
Yu Yue Du ◽  
Yu Hui Ning ◽  
Liang Qi
Keyword(s):  
Petri Nets ◽  
Incidence Matrix ◽  
Reachability Analysis

A Method to Compute Siphons Based on Matrix Manipulation

2011 ◽  
Vol 88-89 ◽  
pp. 486-490
Author(s):  
Xue Peng Chen ◽  
Liang Xu Zhao ◽  
Shan Fa Lin ◽  
Wen Hui Wu
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Incidence Matrix ◽  
Sequential Processes ◽  
Matrix Manipulation ◽  
Structural Object ◽  
And Control

As a structural object of Petri nets, siphons are significant in the analysis and control of deadlocks in a Petri net. However, some existing siphon computation methods are quite time-consuming. In this paper, based on incidence matrix manipulation, a new method is proposed to compute a set of siphons in a class of Petri nets called systems of simple sequential processes with resources (S3PR). The proposed method consists of two algorithms: 1) computation of an unmarked maximal siphon and 2) obtain minimal siphons from an unmarked maximal siphon. A flexible manufacturing systems (FMS) example is used to illustrate the proposed method.

Sign in / Sign up

Export Citation Format

Share Document