By Topic

Algebraically structured colored Petri nets to model sequential processes

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

1 Author(s)
Bourcerie, M. ; Dept. of Electr. Comput. & Syst. Eng., Angers Univ.

Sequential processes can hardly be modeled with Colored Petri Nets (CPN). Their standard functions (such as “Succ” and “Prec”) can only describe simple cases whereas modeling a complex sequence requires the definition of a function via a cumbersome and static table. In order to overcome these limitations, we first introduce a mixed structure based upon CPN and FIFO queues; then, we define an isomorphism between the set of colors and a finite field Z /pZ enabling symbolic calculation using polynomials associated with arcs instead of linear functions mapping sets into sets. Finally, several examples illustrate their modeling capabilities including failure recovery

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:27 ,  Issue: 4 )