Abstract
In spite of their increasing popularity for modeling and performance analysis of parallel systems, Petri nets play only a marginal role in the area of synthesis of asynchronous hardware. It is suggested that a change in the perception of their role will lead to a cost effective design method for parallel asynchronous architectures. A hardware implementable subclass of Petri nets is presented that exploits conflicts as a nondeterministic scheduling feature and that offers token evaluation as an option for path selection. The net primitives, complemented with functional primitives, constitute the lowest abstractions for a data flow oriented design paradigm.
Sign-in/Register to access full text options 
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
