Abstract
The parallelization of systems can result in faster and more efficient operation. Local Area Networks (LANs) are gaining importance for implementing parallel computers because of the availability and experience on the IBM PC. According to the Wall Street Journal May 23, 1990 in the article ‘PC networks begin to oust mainframes in some companies’, the IBM PS/2 LAN is touted as working as a “very small mainframe”, and their inexpensive yet reliable software is noted. One possible LAN utilization is as a parallel computer system for certain problems. The Petri Net is a graph model with the ability to depict concurrency and parallelism, the ability to describe a system at various levels of abstraction, and can show control elements using tokens. In this paper, we utilize the LAN to compute the parallel portions of the Petri net reachability tree.
Sign-in/Register to access full text options 
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.
