A comparison of the expressiveness of SPA and bounded SPN models
Jane Elizabeth Hillston, Laura Recalde, Marina Ribaudo, Manuel Silva · 2002
This paper presents some transformation techniques from bounded SPN systems to corresponding SPA models, preserving concurrency. Initially, a simple algorithm is introduced, showing that the obtained SPA models simulate the net systems. Then the algorithm is improved in order to keep more of the net structure, when possible. For the case of non ordinary net systems the SPA language is extended by introducing a new cooperation operator.