The knitting technique and its application to communication protocol synthesis

The Petri net (PN) can be incrementally expanded by adding paths of nodes according to the synthesis rules. These paths of nodes are generated to increase the number of concurrent, conditional, and iterative processes. A set of synthesis rules has been developed to ensure the correct generation of these paths of nodes. The advantages of these rules include the possibility of implementation as a CAD tool, the guarantee of liveness, boundedness, and reversibility (well-behaved properties), and the close control of concurrency and nondeterminism. These rules serve two functions for interactive design: prevention of potential problems and guidance of correct new path generations. Examples of synthesis and a procedure of finding invariants are presented to show that one can synthesize PNs beyond asymmetric-choice nets. The technique is applied to the synthesis of communication protocols and extended to synthesize local entities.<<ETX>>

[1]  C. V. Ramamoorthy,et al.  An Implementation of an Automated Protocol Synthesizer (APS) and Its Application to the X.21 Protocol , 1985, IEEE Transactions on Software Engineering.

[2]  Daniel Y. Chao,et al.  Extending the Knitting Technique to Petri Net Synthesis of Automated Manufacturing Systems , 1994, Comput. J..

[3]  D. T. Wang,et al.  Iteration bounds of single-rate data flow graphs for concurrent processing , 1993 .

[4]  C. V. Ramamoorthy,et al.  Synthesis rules for cyclic interactions among processes in concurrent systems , 1988, Proceedings COMPSAC 88: The Twelfth Annual International Computer Software & Applications Conference.

[5]  D. T. Wang,et al.  Knitting technique and structural matrix for deadlock analysis and synthesis of Petri nets with sequential exclusion , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[6]  Yuh Yaw,et al.  The algorithm of a synthesis technique for concurrent systems , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[7]  D. T. Wang,et al.  Extending Knitting Technique To Petri Net Synthesis Of Automated Manufacturing Systems , 1992, Proceedings of the Third International Conference on Computer Integrated Manufacturing,.

[8]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[9]  Gérard Berthelot,et al.  Petri Nets Theory for the Correctness of Protocols , 1982, PSTV.

[10]  趙玉.  Synthesis and Performance Evaluation of Two-Party Error-Recoverable Protocols , 1986 .

[11]  Daniel Y. Chao,et al.  Dependency Analysis - A Petri-Net-Based Technique for Synthesizing Large Concurrent Systems , 1993, IEEE Trans. Parallel Distributed Syst..

[12]  Daniel Y. Chao,et al.  A synthesis technique of general petri nets , 1994, J. Syst. Integr..

[13]  D. T. Wang,et al.  Performance evaluation using data flow graphs for concurrent processing , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.

[14]  C. V. Ramamoorthy,et al.  A petri net reduction algorithm for protocol analysis , 1986, SIGCOMM '86.

[15]  Daniel Y. Chao,et al.  Minimum Marking for No Loop-Combination of General Petri Nets , 1993, MASCOTS.

[16]  D. T. Wang,et al.  XPN-FMS: A CAD tool for FMS modeling, analysis, animation, and simulation using Petri nets and X window , 1995 .