Petri nets for protocol engineering

Computer Communications

Volumn 19, Issue 14, 1996, Pages 1250-1257

  Cheung, To Yat ^a  

^a NONE

Author keywords

Formal description technique; Invariant; Petri net; Protocol; Reachability; Specification; Synthesis; Testing; Verification

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SIMULATION; EQUIVALENCE CLASSES; ERROR DETECTION; FORMAL LOGIC; PETRI NETS; SYSTEMS ANALYSIS; TESTING;

INVARIANT; PROTOCOL ENGINEERING; REACHABILITY; VERIFICATION;

NETWORK PROTOCOLS;

EID: 0030363158     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(96)01158-9     Document Type: Article

References (84)

1. G. Chiola, R. Gaeta and M. Sereno, Modeling and simulation of a communication protocol by SWN, Tutorial, Xth Int. Conf. Applic. & Theory of Petri nets; Turin, Italy, 1995, pp. 67-78.
2. F. Feldbrugge and K. Jensen, Computer tools for high-level Petri nets, in K. Jensen and G. Rosenberg, High-Level Petri nets, Springer-Verlag, 1991, pp. 691-717.
3. F. Feldbrugge, Petri net tool overview, Petri net Newsletter, 41 (1992) 2-42.
4. A. Danthine and R.J. Bremer, Modelling and verification of end-to-end transport protocols, Computer Networks, 2(4/5) (1978) 381-395.
5. M. Diaz, Modeling and analysis of communication and cooperation protocols using Petri net based models, Computer Networks, 6 (1982) 419-441.
6. M. Diaz, Petri net based models in the specification and verification of protocol, in W. Brauer, W. Reisig and G. Rozenberg (ed.), Petri nets: Central Model and their Properties, Springer-Verlag, 1987.
7. H.J. Burkhardt, H. Eckert and R. Prinoth, Modelling of OSI-communication services and protocols using predicate/transition nets, Protocol Specification, Testing and Verification-IV, 1984, pp. 165-192.
8. J. Billington, G. Wheeler and M. Wilbur-ham, PROTEAN: a high-level Petri net tool for the specification and verification of communication protocols, IEEE Trans. Soft. Eng., SE-14(3) (1988) 301-316.
9. T.Y. Cheung and X. Qiu, PNPUO - A Petri net based software package for protocol validation, Proc. COMNET'85, Budapest, Hungary, 1985, pp. 6.103-6.132.
10. M. Diaz and P. Senac, Time streams Petri nets: a model for timed multimedia information, Lecture Notes in Computer Science, 815, Springer-Verlag, 1994, pp. 219-238.
11. J. Carlier and Ph. Chretienne, Timed Petri net schedules, Lecture Notes in Computer Science, 340, Springer-Verlag, 1988, pp. 62-84.
12. P. Senac, P. de Saqui-Sannes and R. Willrich, Hierarchical time stream Petri net: A model for hypermedia systems, Lecture Notes in Computer Science, 935, Springer-Verlag, 1995, pp. 451-470.
13. M. Antilla, H. Eriksson, J. Ikonen, R. Kujansuu, L. Ojala and H. Tuominen, Tools and studies of formal techniques - Petri nets and temporal logic, Protocol Specification, Testing and Verification-III, North-Holland, Amsterdam, 1983, pp. 139-148.
14. I. Suzuki and H. Lu, Temporal Petri nets and their application to modeling and analysis of a Handshake Daisy Chain Arbiter, IEEE Trans. Computers, 38(5) (1989) 696-704.
15. I. Suzuki, Formal analysis of the alternating bit protocol by temporal Petri nets, IEEE Trans. Softw. Eng., 16(11) (1990) 1273-1281.
16. T. Li, I. Suzuki and M. Yamashita, A new structural induction theorem for rings of temporal Petri nets, IEEE Trans. Softw. Eng., 20(2) (1994) 115-126.
17. G.R. Wheeler, M.C. Wilbur-Ham, J. Billington and J.A. Gilmour, Protocol analysis using numerical Petri nets, Lecture Notes in Computer Science, 222, Springer-Verlag, 1985, pp. 435-452.
18. S. Haddad, A reduction theory for colored Petri nets, Lecture Notes in Computer Science, 424, Springer-Verlag, 1990, pp. 209-235.
19. C. Lakos, From colored Petri Nets to Object Petri nets, Lecture Notes in Computer Science, 935, Springer-Verlag, 1995, pp. 278-297.
20. T.Y. Cheung and Y. Lu, Managing feature interactions in telephone systems by temporal colored Petri nets, Technical Report, Department of Computer Science, City University of Hong Kong, 1996.
21. S. Christensen and N.D. Hansen, Colored Petri nets extended with channels for synchronous communication, Lecture Notes in Computer Science, 815, Springer-Verlag, 1994, pp. 159-178.
22. T.Y. Cheung and Y. Lu, Detecting and resolving the interaction between telephone features Terminating Call Screening and Call Forwarding by colored Petri nets, Proc. IEEE Int. Conf. on Systems, Man and Cybernetics, Vancouver, Canada, 1995, pp. 2245-2250.
23. E. Battiston, F. De Cindio and G. Mauri, OBJSA nets: a class of high-level nets having objects as domains, Lecture Notes in Computer Science, 340, Springer-Verlag, 1988, pp. 20-43.
24. C. Lakos, J. Lamp, C. Keen and B. Marriott, Modeling network protocols with Object Petri nets, Tutorial, 16th Int. Conf. Applic. & Theory of Petri Nets, Turin, Italy, 1995, pp. 31-42.
25. G. Berthelot, Transformations and decompositions of nets, Lecture Notes in Computer Science, 254, 1987, pp. 359-376.
26. K. Lautenbach and H. Ridder, Liveness in bounded Petri nets which are covered by t-invariants, Lecture Notes in Computer Science, 815, 1994, pp. 358-375.
27. H. Lee-Kwang, J. Favrel and P. Baptiste, Generalized Petri net reduction methods, IEEE Trans. Systems, Man, Cybernetics, SMC-17 (1987) 297-303.
28. C.V. Ramamoorthy and Y. Yaw, A Petri net reduction algorithm for protocol analysis, Proc. SIGCOMM'86 Symp., Communications Architecture & Protocol, Stowe, VT, 1986, pp. 305-327.
29. M. Notomi and T. Murata, Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis, IEEE Trans. Softw. Eng., 20(5) (1994) 325-336.
30. J.G. Hartmenn, Equivalence transformations of Petri nets, Lecture Notes in Computer Science, 424, Springer-Verlag, 1990.
31. C. Simone and M.A. Marson, The application of EB-equivalence rules to the structural reduction of GSPN models, J. Parallel and Distributed Computing, 15 (1992) 296-302.
32. A. Valmari, Stubborn sets for reduced state space generation, 10th Int. Conf. Applic. & Theory of Petri Nets, Bonn, Germany, 1989, pp. 1-22.
33. A. Valmari, On-the-fly verification with stubborn sets, Lecture Notes in Computer Science, 697, Springer-Verlag, 1993, pp. 397-408.
34. P. Godefroid and P. Wolper, A partial order approach to model checking, Proc. 6th Ann. IEEE Symposium on Logic in Computer Science, Amsterdam, 1991, pp. 405-415.
35. K. Varpaaniemi, On combining the stubborn set method with the sleep set method, Lecture Notes in Computer Science, 815, Springer-Verlag, 1994, pp. 548-567.
36. R. Brgan and D. Poitrenaud, An efficient algorithm for the computation of stubborn sets of well-formed Petri nets, Lecture Notes in Computer Science, 935, Springer-Verlag, 1995, pp. 121-140.
37. M. Tiusanen, Symbolic, symmetry, and stubborn set searches, Lecture Notes in Computer Science, 815, Springer-Verlag, 1994, pp. 511-530.
38. I. Suzuki and T. Murata, A method for stepwise refinement and abstraction of Petri nets, J. Comp. System Sciences, 27 (1983) 51-76.
39. A.W. Vogler, Behaviour preserving refinements of Petri nets, Lecture Notes in Computer Science, 246, Springer-Verlag, 1987.
40. Y. Souissi, On liveness preservation by composition of nets via a set of places, Lecture Notes in Computer Science, 524, Springer-Verlag, 1991, pp. 277-295.
41. G.J. Holzmann, Design and Validation of Computer Protocols, Prentice Hall, 1991.
42. Y. Chen, W.T. Tsai and D. Chao, Dependency analysis - a Petri net based technique for synthesizing large concurrent systems, IEEE Trans. Parallel and Distributed Systems, 4(4) (1993).
43. 3-editor: Compositional Petri net editor for protocol specification, Proc. 2nd Int. Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, Durham, North Carolina, 1994, pp. 325-328.
44. A. Valmari, Compositional analysis with place-bordered subnets, Lecture Notes in Computer Science, 815, Springer-Verlag, 1994, pp. 531-547.
45. C. Sibertin-Blanc, A client-server protocol for the composition of Petri nets, Lecture Notes in Computer Science, 691, Springer-Verlag, 1993, pp. 377-396.
46. C. Sibertin-Blanc, Cooperative nets, Lecture Notes in Computer Science, 815, 1994, pp. 471-490.
47. K. Jensen, Colored Petri nets: A high level language for system design and analysis, Lecture Notes in Computer Science, 483, Springer-Verlag, 1990, pp. 342-416.
48. T.Y. Cheung and W. Zeng, Invariant-preserving transformations for the verification of place/transition systems (with application to communication protocols), Technical Report TR-94-03, Department of Computer Science, City University of Hong Kong, July 1994.
49. T.Y. Cheung and Y. Lu, Invariant-preserving transformations on colored Petri nets and their applications, Technical Report, Department of Computer Science, City University of Hong Kong, 1996.
50. P. Graubmann, E. Rudolph and J. Grabowski, Towards a Petri net based semantics definition for message sequence charts, in O. Faergemand and A. Sarma (eds.), SDL '93: Using Objects, Elsevier, 1993, pp. 179-190.
51. CCITT Recommendation Z. 120, Message Sequence Charts, Geneva, 1992.
52. P. Graubmann and E. Rudolph, A method and a tool for the validation of SDL-diagrams, 2nd SDL Users and Implementors Forum, 1985.
53. J. Grabowski, P. Graubmann and E. Rudolph, Towards an SDL-design-methodology using message sequence charts, in O. Faergemand and R. Reed (eds.), SDL '91: Evolving Methods, North Holland, 1991.
54. J. Grabowski, Statische und dynamische analysen fur SDL-prozessgiagramme auf der basis von Petri-Netzen und sequence charts, Diploma Thesis, University of Hamburg, 1990.
55. A. Alkhechi and S. Budkowski, Automatic translation of time Petri nets into ESTELLE description, Formal Description Techniques, 1991, pp. 369-376.
56. J. Fischer and E. Dimitrov, Verification of SDL protocol specifications using Extended Petri nets, Tutorial, 16th Int. Conf. Applic. & Theory of Petri Nets, Turin, Italy, 1995, pp. 1-12.
57. J. Nutzel and W. Fengler, Analysis and verification of high-level-nets in combination with formal ESTELLE specifications, Tutorial, 16th Int. Conf. Applic. & Theory of Petri Nets, Turin, Italy, 1995, pp. 13-18.
58. U. Golltz and A. Mycroft, On the relationship of CCS and Petri nets, Lecture Notes in Computer Science, 172, Springer-Verlag, 1984, pp. 196-208.
59. P. Degano, R. Gorrieri and S. Marchetti, An exercise in concurrency: A CSP process as a condition/event system, Lecture Notes in Computer Science, 340, Springer-Verlag, 1988, pp. 85-105.
60. E.R. Olderog, Operational Petri net semantics for CCSP, Lecture Notes in Computer Science, 266, Springer-Verlag, 1987, pp. 196-223.
61. S. Marchena and G. Leon, Transformation from LOTOS to Galileo nets, Formal Description Techniques-I, 1989, pp. 217-230.
62. H. Garavel and E. Najm, TILT: from LOTOS to labelled transition systems, Formal Description Techniques - LOTOS, Vol. I, North-Holland, 1989, pp. 327-336.
63. T.Y. Cheung and X. Zhu, A formal-method approach for cyclomatic complexity of distributed software, in Qian Weichang (ed.), Transactions of K.C. Wong Education Foundation Supported Lectures, K.C. Wong Education Foundation, 1994, pp. 99-118.
64. B. Baumgarten and H. Wiland, What is a correct test case? Elements of a Petri net oriented theory of protocol testing, Tutorial, 16th Int. Conf. Applic. & Theory of Petri Nets, Turin, Italy, 1995, pp. 19-30.
65. T.Y. Cheung, Y. Wu and X. Ye, Generating test sequences and their degrees of indeterminism for protocols, Protocol Specification, Testing and Verification-XI, North-Holland, 1991, pp. 301-316.
66. T.Y. Cheung and S. Ren, Executable selective test sequences with operational coverage for LOTOS specifications, Proc. Int. Phoenix Conf. Computers and Communications, Tempe, Arizona, 1993, pp. 245-253.
67. T. Y. Cheung, S. Ren and W.M. Mak, A tool for assessing the quality of distributed software designs specified in LOTOS, Proc. Software Education Conference, Dunedin, New Zealand, 1994, pp. 42-49.
68. T.Y. Cheung and X. Ye, A fault-detection approach to conformance testing of nondeterministic distributed systems, J. Parallel and Distributed Computing, 28 (1995) 940-100.
69. L. Pomello, G. Rozenberg and C. Simone, A survey of equivalence notions for net based systems, Lecture Notes in Computer Science, 609, Springer-Verlag, 1992, pp. 304-351.
70. G.Q. Wang, A unified approach for equivalence relations of indeterministic distributed systems, thesis, University of Ottawa, 1991.
71. G. Schreiber, Functional equivalence of Petri nets, Lecture Notes in Computer Science, 935, Springer-Verlag, 1995, pp. 432-450.
72. C.A. Lakos and C.D. Keen, Modelling layered protocols in LOOPN, Proc. 4th International Workshop on Petri nets and Performance Models, Melbourne, Australia, 1991.
73. C.A. Lakos and C.D. Keen, Modelling a door controller protocol in LOOPN, Proc. 10th Euro. Conf. on Technology of Object-Oriented Languages and Systems, Versailles, France, 1993.
74. M. Baldassari and G. Bruno, An environment for object-oriented conceptual programming based on PROT nets, Lecture Notes in Computer Science, 340, Springer-Verlag, 1988, pp. 1-19.
75. T.Y. Cheung and A. Ghedamsi, A Petri-Net-based synthesis algorithm for network protocol design, Proc. Int. Conf. Communications Technology (ICCT'92), Beijing, 1992, pp. 15.11.1-15.11.6.
76. J. Esparza and M. Silva, Top-down synthesis of live and bounded free choice nets, Lecture Notes in Computer Science, 524, Springer-Verlag, 1991, pp. 118-139.
77. D.Y. Chao and D. Wang, The knitting technique and its application to communication protocol synthesis, Proc. 2nd Int. Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, Durham, North Carolina, 1994, pp. 234-238.
78. T. Bolognesi, F. Lucidi and S. Trigila, From timed Petri nets to timed LOTOS, Protocol Specification, Testing and Verification, Vol X, North-Holland, 1990, pp. 395-408.
79. L.G. Bouma and H. Velthuijsen (eds.), Feature Interactions in Telecommunications Systems, IOS-Press, Amsterdam, 1994.
80. M. Faci and L. Logrippo, Specifying features and analysing their interactions in a LOTOS environment, in L.G. Bouma, and H. Velthuijsen (eds.), Feature Interactions in Telecommunications Systems, IOS-Press, Amsterdam, 1994, pp. 136-151.
81. W.M. Mak and T.Y. Cheung, Detecting feature interactions in the modular design of LOTOS specifications by temporal logic, Technical paper, Department of Computer Science, City University of Hong Kong, 19??
82. M. Silva and J.M. Colom, On the computation of structural synchronic invariants in P/T nets, Lecture Notes in Computer Science, 340, Springer-Verlag, 1988, pp. 386-317.
83. J.M. Couvreur and E. Paviot-Adet, New structural invariants for Petri nets analysis, Lecture Notes in Computer Science, 815, Springer-Verlag, 1994, pp. 199-218.
84. N. Bennacer, G. Florin, C. Fraize and S. Natkin, Probabilistic validation of a remote call procedure, Lecture Notes in Computer Science, 815, Springer-Verlag, 1994, pp. 59-78.