The Computer Journal Advance Access originally published online on July 15, 2005
The Computer Journal 2005 48(6):692-701; doi:10.1093/comjnl/bxh125
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||
Handling Synchronization Problem in Petri Net-Based System Design by Property-Preserving Transition-Reduction
1 Laboratory of Computer Science, Institute of Software and 2 Academy of Mathematics and System Science, Chinese Academy of Sciences, Beijing, China 3 Department of Computer Science, City University of Hong Kong, China
Email: ljiao{at}ios.ac.cn
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.
Handling Editor: Ing-Ray Chen