By Topic

Memory-based implementation of a Petri net and its application to a programmable controller

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
$31 $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

4 Author(s)

In this paper, a memory-based Petri net implementation is discussed. To realize a memory-based implementation, a sub-class Petri net model is suggested. The suggested model, B-Petri net, is a marked graph whose numbers of input places and output places of a transition are limited to two. The B-Petri net has the same modeling power as a marked graph. The complexity of the B-Petri net is analyzed, and the hardware implementation architecture of a programmable controller based on it is also suggested. The memory tables have realizable memory size, and they are reduced well in case of some real applications like a programmable controller

Published in:

Industrial Electronics, Control, and Instrumentation, 1993. Proceedings of the IECON '93., International Conference on

Date of Conference:

15-19 Nov 1993