Results 1  10
of
1,320
The Linear Algebra of Deadlock Avoidance — A Petri Net Approach
, 1996
"... An algorithm is presented which prevents place/transition systems with finitely many states (boundedness) from running into dead markings. The algorithm determines supplementary places which protect structural deadlocks from becoming insufficiently marked. All steps, the determination of minimal dea ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
deadlocks, the test whether deadlocks can be emptied, the determination of the supplementary places and their initial markings etc., consist in solving systems of linear homogeneous inequalities and equations. The algorithm is optimal in that the dynamic behaviour of the nets is limited only as far
Algebraic System Analysis of Timed Petri Nets
, 1997
"... We show that Continuous Timed Petri Nets (CTPN) can be modeled by generalized polynomial recurrent equations in the (min,+) semiring. We establish a correspondence between CTPN and Markov decision processes. We survey the basic system theoretical results available: behavioral (inputoutput) properti ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
We show that Continuous Timed Petri Nets (CTPN) can be modeled by generalized polynomial recurrent equations in the (min,+) semiring. We establish a correspondence between CTPN and Markov decision processes. We survey the basic system theoretical results available: behavioral (input
Recursion and Petri Nets
, 2001
"... This paper shows how to define Petri nets through recursive equations. It specifically addresses this problem within the context of the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The paper presents a detailed investigation of the solvabili ..."
Abstract
 Add to MetaCart
This paper shows how to define Petri nets through recursive equations. It specifically addresses this problem within the context of the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The paper presents a detailed investigation
FreeChoice Petri Nets An Algebraic Approach
, 1996
"... In this paper, we give evolution equations for free choice Petri net which generalize the [max; +] algebraic setting already known for event graphs. These evolution equations can be seen as a coupling of two linear systems, a (min; +)linear system, and a quasi (+; \Theta)linear one. This leads t ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
In this paper, we give evolution equations for free choice Petri net which generalize the [max; +] algebraic setting already known for event graphs. These evolution equations can be seen as a coupling of two linear systems, a (min; +)linear system, and a quasi (+; \Theta)linear one. This leads
On the computation of place invariants for algebraic Petri nets
 Proceedings of the STRICT workshop
, 1995
"... The paper is concerned with the computation of a generator set for the space of all place invariants for a given algebraic net. We will show that the problem can be divided into two major steps. First we trace back the problem to a set of equations between terms. Then we combine the solutions of the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The paper is concerned with the computation of a generator set for the space of all place invariants for a given algebraic net. We will show that the problem can be divided into two major steps. First we trace back the problem to a set of equations between terms. Then we combine the solutions
Linear Algebraic Techniques For The Analysis Of Petri Nets
 In: Recent Advances in Mathematical Theory of Systems, Control, Networks, and Signal Processing II
, 1992
"... One of the indigenous techniques for the analysis of Petri Net system models is based on its nonnegative state equation, bridging convex goemetry and linear programming theories to the theory of Petri Nets. This invited survey briefly overviews some recent developments in the use of linear alge ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
, performance properties, Petri nets, state equation. 1. MOTIVATION Structural analysis of Petri Nets focuses on the relationship between the net structure and its behaviour. Net structure can be studied using graph theory arguments or through linear algebra based arguments, using the incidence matrices (P re
Verifying PetriNet Models Using Process Algebra
, 2003
"... munication protocol between the various parts of the system plays an important role. It is not very well suited for dataoriented applications. However, if Petri nets and process algebra both focus on dynamic system behaviour, what then is the use of combining them? The answer is simple: They comple ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
munication protocol between the various parts of the system plays an important role. It is not very well suited for dataoriented applications. However, if Petri nets and process algebra both focus on dynamic system behaviour, what then is the use of combining them? The answer is simple
Liveness in FreeChoice Petri Nets An Algebraic Approach
"... In this paper, we show that the evolution equations for timed free choice Petri net can be used to prove logical properties of the underlying untimed net. For example, this approach leads to new methods and algorithms to check liveness and several other basic properties, such as absence or presence ..."
Abstract
 Add to MetaCart
In this paper, we show that the evolution equations for timed free choice Petri net can be used to prove logical properties of the underlying untimed net. For example, this approach leads to new methods and algorithms to check liveness and several other basic properties, such as absence
An Holistic State Equation for Timed Petri Nets
"... Timed Petri nets (TPN) or Duration Petri nets (DPN) is a wellknow approach to extend “classic ” Petri nets in order to allow the modeling of time [1]. In [2], a state equation for TPN was provided that describes the net’s marking in an algebraic manner, but not its transitions clocks. Hence, proofi ..."
Abstract
 Add to MetaCart
Timed Petri nets (TPN) or Duration Petri nets (DPN) is a wellknow approach to extend “classic ” Petri nets in order to allow the modeling of time [1]. In [2], a state equation for TPN was provided that describes the net’s marking in an algebraic manner, but not its transitions clocks. Hence
On the Algebraic Structure of Petri Nets
 Bulletin of EATCS
, 2000
"... This paper retraces, collects, and summarises the contributions of the author — both individually and in collaboration with others — on the theme of algebraic, compositional approaches to the semantics of Petri nets. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper retraces, collects, and summarises the contributions of the author — both individually and in collaboration with others — on the theme of algebraic, compositional approaches to the semantics of Petri nets.
Results 1  10
of
1,320