Abstract
Over the last decade, Petri nets have emerged as a most suitable, powerful and widely acceptable modeling tool for representing and studying the asynchronous concurrent hardware (or software) systems/processes. Petri nets can be viewed as formal automata or as an automation which can generate the formal languages or a model to analyse and synthesize various kinds of systems. The structure of Petri nets, their markings, extensions and subclasses are briefly discussed. Several examples of Petri net models of computer hardware and software are presented. Various applications of reachability concepts are also given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
