Referenced Items are not available for this document.
In this paper, we suggests a WIP (work in process) of FMS analysis methods based on the TPN (time Petri nets) unfolding. Unfolding of PN is a partial order-based method for the verification of concurrent system without the state space explosion. The aim of this work is to formulate the general cyclic state scheduling problem to minimize the WIP to satisfy economical constraints. The method is based on unfolding of the original net into the equivalent acyclic description.
Published in:
Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on
(Volume:1
)
Date of Conference: 11-14 Oct 1998
- Page(s):
- 136 - 141 vol.1
- ISSN :
- 1062-922X
- Print ISBN:
- 0-7803-4778-1
- INSPEC Accession Number:
- 6175809
- Digital Object Identifier :
- 10.1109/ICSMC.1998.725398
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
