Abstract
At present, in the design and analysis of discrete event systems, the parallel or distributed simulation mechanism is adopted to make these models occur concurrently , then the problem will be easy to be solved, the validation of their models is often addressed via simulation. Lookahead computation is a good method that improves the distributed simulation performance of timed transition Petri nets (TTPN). Extended timed Petri nets (ETTPN) is extended in time based on TTPN, it meet lookahead requirements, and use the lookahead to analyze the ETTPN model for finding the concurrency and blocking structure, thereby making certain the logical process (LP). Based on the specialties of lookahead, the lookahead was applied in parallel simulation, and acquire the sufficient condition about the ETTPN model existing concurrency. According to the condition, parallel program can be partitioned into several logical processes, and the partition algorithm about distributed processing is avail. In order to reduce error rate,a improved mapping algorithm is presented.
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.
