A Comparison of the Expressiveness of SPA and Bounded SPN Models

J. Hillston, L. Recalde, M. Silva, M. Ribaudo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.
Original languageEnglish
Title of host publicationProceedings 9th International Workshop on Petri Nets and Performance Models, Proceedings 9th International Workshop on Petri Nets and Performance Models 2001,
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages197
Number of pages1
ISBN (Print)0-7695-1248-8
DOIs
Publication statusPublished - 2001

Cite this