By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
E. R. Boer ; Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA ; T. Murata

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

Published in:

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications  (Volume:41 ,  Issue: 4 )