scispace - formally typeset
Journal ArticleDOI

Generating basis siphons and traps of Petri nets using the sign incidence matrix

Reads0
Chats0
TLDR
In this paper, the sign incidence matrix for Petri nets is introduced and a simple algorithm for generating all basis siphons or traps without first generating all siphons and traps is presented.
Abstract
This paper introduces a new matrix called the sign incidence matrix for Petri nets. Using this sign incidence matrix, we present a simple algorithm for generating all basis siphons or traps without first generating all siphons or traps. Any siphon (trap) can be expressed as an union of basis siphons (basis traps). The concept of siphons and traps plays an important role in the analysis of Petri nets. In particular, criteria for liveness and reachability of some subclasses of Petri nets can be stated in terms of siphons and traps. >

read more

Citations
More filters
Journal ArticleDOI

Modeling, analysis, simulation, scheduling, and control of semiconductor manufacturing systems: A Petri net approach

TL;DR: A formal approach such as Petri nets enables one to describe such complex discrete event systems precisely and thus allows one to perform both qualitative and quantitative analysis, scheduling and discrete-event control of them.
Journal ArticleDOI

Selective Siphon Control for Deadlock Prevention in Petri Nets

TL;DR: In this paper, a novel method is proposed that provides small size controllers, based on a set covering approach that conveniently relates siphons and markings, and is compared with other methods proposed in the literature.
Journal ArticleDOI

Combined Siphon and Marking Generation for Deadlock Prevention in Petri Nets

TL;DR: A modified version of the siphon-control method is proposed that achieves the same results in terms of permissivity and size of the control subnet but avoids full siphon enumeration, which greatly reduces the overall computational time and memory requirements and allows the applicability of the method to large-size models.
Proceedings ArticleDOI

Gadara: dynamic deadlock avoidance for multithreaded programs

TL;DR: Gadara automates dynamic deadlock avoidance for conventional multithreaded programs and employs whole-program static analysis to model programs, and Discrete Control Theory to synthesize lightweight, decentralized, highly concurrent logic that controls them at runtime.
Journal ArticleDOI

Resource-Transition Circuits and Siphons for Deadlock Control of Automated Manufacturing Systems

TL;DR: This paper concentrates on a class of Petri nets called a system of simple sequential processes with resources, establishes the relation between two kinds of control methods, and identifies maximal perfect RTCs and SMSs and establishes an equivalence between two deadlock control methods.
References
More filters
Journal ArticleDOI

Petri nets: Properties, analysis and applications

TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Book ChapterDOI

Linear algebraic calculation of deadlocks and traps

TL;DR: In this paper, it is shown how deadlocks and traps of a class of transition-nets can be calculated as S-invariants of marked graphs, where S is the length of the transition-net.
Book ChapterDOI

A New Technique for Finding a Generating Family of Siphons, Traps and st-Components. Application to Colored Petri Nets

TL;DR: A new solution to the problem of finding generating families of siphons, traps, traps and st-components in Petri Nets by means of transformation into a system of linear equations.
Proceedings ArticleDOI

A Petri net semantics for logic programs with negation

TL;DR: The authors show that an unfounded set corresponds to a siphon in Petri net theory when one deletes the transitions disabled by the secure application of firing rules, and that the property of siphons simplifies the computation of well-founded semantics for logic programs.
Related Papers (5)