I’m implementing a coloured petri net in Java. It’s kind of a finite state automata. The problem is that I don’t know how to implement “binding”. In other words, colors should be assigned to places and arc expressions should be assigned to arcs. After a transition is executed, a net should go into a new state. So, I have no idea how to assign functions to arcs.
I hope my question is clear, because I don’t want to explain basics of coloured petri nets here. I appreciate if someone could provide a web-link to sample Java code of a colored petri net or give some ideas how to assign functions to arcs.
I’m implementing a coloured petri net in Java. It’s kind of a finite state
Share
The article Enumerated Functions shows one approach.