Skip to main content
Conference Proceedings

On the abstraction of coloured petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1248 42-61
DOI: 10.1007/3-540-63139-9_29
16Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper considers the appropriate properties for net components in the Coloured Petri Net formalism. In doing so, it attempts to maintain the duality between places and transitions which is so foundational to Petri Net theory. It also defines what it means to execute the net at an abstract level.

Author supplied keywords

Cite

CITATION STYLE

APA

Lakos, C. (1997). On the abstraction of coloured petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1248, pp. 42–61). Springer Verlag. https://doi.org/10.1007/3-540-63139-9_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free