Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at onlinesupport@ieee.org. We apologize for any inconvenience.
By Topic

A comparison of two analysis algorithms for fuzzy marking Petri nets

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

2 Author(s)
Ammar, H.H. ; Dept. of Comput. Sci. & Electr. Eng., West Virginia Univ., Morgantown, WV, USA ; Yu, L.

Fuzzy marking Petri Nets (FMPNs) were presented by the authors (1995) as an extension of Petri Nets in which markings are imprecise numbers represented by membership functions. In this paper, two analysis algorithms for the reachability analysis of FMPNs are presented and compared. A simple example of a FMPN is analyzed using the two algorithms

Published in:

Fuzzy Systems Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on  (Volume:2 )

Date of Conference:

4-9 May 1998