Abstract
Concurrency is a fundamental problem and a solution applicable to different areas of computing. Given the complexities and distribution of computer systems and services, concurrency is a modern area requiring proper attention. Petri nets are formalisms based on process representation both from a mathematical view and from a graphical or drawing like view. Petri nets are used to model concurrent processes. This work deals with understanding and representing low level concurrency in Petri nets, when this is not always visible and properly noted from the graphical structure. In this study an algebraic notation has been devised and is used to represent the Petri net structures. This algebraic notation is used as an alternative and simplified way of representation. The notation is explained and several simple examples are given. The notation presented can be used in conjunction with other Petri net analysis and verification methods. Some results and findings are discussed.
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
