With an application to workflow management based on colored Petri net
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Module-based architecture for a periodic job-shop scheduling problem
Computers & Mathematics with Applications
| Hi-index | 0.00 |
Synchronizations frequently occur in the modeling and design of distributed and concurrent systems. Designing a correct system from subsystems by considering the synchronizations of events is a difficult and complex task because it often destroys some desirable properties of subsystems and induces the whole system deadlocks. This paper formulates a property-preserving transition-reduction transformation to handle the synchronization problem in Petri net-based system design. It starts by designing correct subsystems without taking transition-reduction consideration. Synchronizations are then introduced by merging transitions of subsystems. Depending on the structure of transitions, two classes of transition-reductions are investigated. For each class, this paper shows that many structural and behavior properties can be preserved.