Abstract
AbstractIn general, systems are comprised of a large number of elements and might be very symmetric. In verification of such systems, they are reduced while upkeeping their global structure and verified with the intuitive expectation that the verification of such reduced systems will yield almost the same results as those of the original ones. However, such verifications do not guarantee the success of original system verifications. In this paper, the target is verification of arbitrary scale systems with star‐shape configuration which can be expressed by Petri nets. The proposed algorithm explores the reachable state space with no dependency on system scale. © 2001 Scripta Technica, Syst Comp Jpn, 32(14): 41–53, 2001
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
