Skip to main content
SpringerLink
Log in
Book cover

Advanced Course on Petri Nets

ACPN 1996: Lectures on Petri Nets II: Applications pp 293–330Cite as

Protocol specification using P-graphs, a technique based on coloured Petri Nets

  • V Applications of High Level Nets
  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1492))

Abstract

P-Graphs combine inhibitor Petri nets and abstract data types within the same algebraic framework. They are useful for the specification of concrete concurrent systems and in particular communication protocols. The inhibitor has been included to allow compact descriptions of systems by promoting the economy of data types. They are also necessary for the purging of resources; a common activity when modelling protocols or their services. This paper introduces P-Graphs with the aid of some simple examples. It also shows how to map P-Graphs to P-nets, which are Coloured Petri Nets (CP-nets) extended with place capacities and inhibitors. This is important for the analysis of P-Graph specifications, as P-nets can be transformed to CP-nets in almost all practical situations. Thus the analysis techniques of CP-nets can then be applied. Useful notation for capacities are introduced and their semantics defined in terms of the P-Graph. A notation for purging places of their tokens is also introduced, involving the superimposition of the inhibitor and normal arc. Two case studies, the Demon game and the M-Access Service of the Cambridge Fast Ring, are included to illustrate the use of the P-Graph and the extended notation for protocol specification.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Battiston, F. De Cindio, and G. Mauri. OBJSA nets: a class of high-level nets having objects as domains. In G. Rozenberg, editor, Advances in Petri Nets 1988, Lecture Notes in Computer Science 340 pages 20–43. Springer-Verlag, Berlin, 1988.

    Google Scholar 

  2. Mirion Y. Bearman. Formal specification of the Open Systems Interconnection Transport Protocol class 2 using NPNs. Technical Report 25, CSIRONET, 1986.

    Google Scholar 

  3. Mirion Y. Bearman, Michael C. Wilbur-Ham, and Jonathan Billington. Some results of verifying the OSI class 0 Transport Protocol. In ICCC, pages 597–602, Sydney, November 1984.

    Google Scholar 

  4. Mirion Y. Bearman, Michael C. Wilbur-Ham, and Jonathan Billington. Analysis of Open Systems Interconnection Transport Protocol standard. Electronics Letters, 21(15):659–661, July 1985.

    Google Scholar 

  5. M.Y. Bearman, K.R. Parker, and R.A. Berger. A formal specification of the OSI Class 3 Transport Protocol using NPNs. Technical Report TR-ED-88-02, CSIRO Division of Information Technology, 1988.

    Google Scholar 

  6. Gerard Berthelot and Richard Terrat. Petri nets theory for the correctness of protocols. IEEE Transactions on Communications, COM-30(12):2497–2505, Dec 1982.

    Google Scholar 

  7. B. Berthomieu, N. Choquet, C. Colin, B. Loyer, J.M. Martin, and A. Mauboussin. Abstract Data Nets: combining Petri nets and abstract data types for high level specifications of distributed systems. In Proceedings of the Seventh European Workshop on Application and Theory of Petri Nets, pages 25–48, Oxford, England, 30 June–2 July 1986.

    Google Scholar 

  8. J. Billington. Extensions to Coloured Petri Nets. In Proceedings of the Third International Workshop on Petri Nets and Performance Models, pages 61–70, Kyoto, Japan, 11–13 December 1989. IEEE CS Press.

    Google Scholar 

  9. J. Billington. Many-sorted high-level nets. In Proceedings of the Third International Workshop on Petri Nets and Performance Models, pages 166–179, Kyoto, Japan, 11–13 December 1989. IEEE CS Press.

    Google Scholar 

  10. J. Billington. Extensions to Coloured Petri Nets and their Application to Protocols. PhD thesis, University of Cambridge, May 1990.

    Google Scholar 

  11. J. Billington, G. Wheeler, and M.C. Wilbur-Ham. PROTEAN: A high-level Petri net tool for the specification and verification of communication protocols. IEEE Transactions on Software Engineering, Special Issue on Tools for Computer Communication Systems, SE-14(3):301–316, March 1988.

    Google Scholar 

  12. Jonathan Billington. Abstract specification of the ISO Transport Service Definition using labelled Numerical Petri Nets. In Harry Rudin and Colin H. West, editors, Protocol Specification, Testing and Verification, III, pages 173–185, Amsterdam, 1983. Elsevier Science Publishers B.V.

    Google Scholar 

  13. Jonathan Billington. Extending coloured Petri nets. Technical Report 148, University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, England, October 1988.

    Google Scholar 

  14. Jonathan Billington. A High-Level Petri net specification of the Cambridge Fast Ring M-Access service. In Proceedings of the BCS-FRCS Workshop on Specification and Verification of Concurrent Systems, University of Stirling, Stirling, Scotland, July 1988. Earlier version published as University of Cambridge Computer Laboratory Technical Report No. 121, December 1987.

    Google Scholar 

  15. Jonathan Billington, editor, Application of Petri Nets to Communication Protocols, Advanced Practical Tutorial Notes, 15th Int. Conference on Application and Theory of Petri Nets, Zaragoza, Spain, 20 June 1994.

    Google Scholar 

  16. Billington J. and Diaz M., editors, Petri Nets applied to Protocols, Proceedings, First PetriNets95 Protocol Workshop, Turin, Italy, 26 June 1995.

    Google Scholar 

  17. Billington J., Development of an International Standard for High-level Petri Nets, In Proc. 3rd IEEE International Software Engineering Standards Symposium and Forum (ISESS'97), Walnut Creek, California, USA, 1–6 June 1997, ISBN: 0-8186-7837-2, pp.155–162.

    Google Scholar 

  18. Billington, J., Farrington M., and Du B.B., Modelling and Analysis of Multi-Agent Communication Protocols, to appear in Proc. 3rd Biennial Engineering Mathematics and Applications Conference (EMAC'98), Adelaide, 13–16 July 1998.

    Google Scholar 

  19. Billington J., Diaz M. and Rozenberg G. (Eds) Application of Petri Nets to Communication Networks, Special Issue of Advances in Petri Nets, Lecture Notes in Computer Science, Springer-Verlag, in preparation.

    Google Scholar 

  20. W. Brauer, W. Reisig, and G. Rozenberg, editors. Petri Nets: Central Models and Their Properties, volume 254 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1987. Advances in Petri Nets 1986, Part 1: Proceedings of an Advanced Course, Bad Honnef, September, 1986.

    Google Scholar 

  21. H. J. Burkhardt and Hans Eckert. Transport service, formal specification; network service, formal specification; transport protocol class 2, formal specification. early drafts, 1984.

    Google Scholar 

  22. H. J. Burkhardt, Hans Eckert, and Rainer Prinoth. Modelling of OSI-communication services and protocols using Predicate/Transition Nets. In Y. Yemini, R. Strom, and S. Yemini, editors, Protocol Specification, Testing and Verification, IV, pages 165–192, Amsterdam, 1985. Elsevier Science Publishers B.V.

    Google Scholar 

  23. A. M. Chambers. CFR M-Access service definition. Draft Unison Project Document, Ref: UA008, November 1986.

    Google Scholar 

  24. A. M. Chambers and D. L. Tennenhouse. Communications architectures for the Cambridge Fast Ring. Draft Unison Project Document, Ref: UA004, October 1986.

    Google Scholar 

  25. J. P. Courtiat, J. M. Ayache, and B. Algayres. Petri nets are good for protocols. In ACM SIGCOMM '84 Symposium, Communications Architectures and Protocols, pages 66–74, Montreal, Canada, June 1984.

    Google Scholar 

  26. B. Cousin, J.M. Couvreur, C. Dutheillet, and P. Estraillier. Validation of a protocol managing a multi-token ring architecture. In Proceedings of the IX European Workshop on Applications and Theory of Petri Nets, Venice, Italy, 22–24 June 1988. Fourth paper in volume 11.

    Google Scholar 

  27. Michel Diaz. Modeling and analysis of communication and co-operation protocols using Petri net based models. Computer Networks, 6:419–441, 1982.

    Google Scholar 

  28. Michel Diaz. Petri net based models in the specification and verification of protocols. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Applications and Relationships to Other Models of Concurrency, pages 135–170. Springer-Verlag, Berlin, 1987. Lecture Notes in Computer Science, Vol. 255.

    Google Scholar 

  29. Diaz M., Little T., and Senac P. (Eds), Multimedia and Concurrency, Workshop Proceedings, Toulouse, France, 24 June 1997.

    Google Scholar 

  30. S. Drees, D. Gomm, H. Phinnecke, W. Reisig, and R. Walter. Bibliography of net theory. In G. Rozenberg, editor, Advances in Petri Nets 1987, pages 309–451. Springer-Verlag, Berlin, April 1987. Latest update is ‘Bibliography of Petri Nets 1988', Arbeitspapiere der GMD, No. 315, June 1988, which contains over 2,500 entries.

    Google Scholar 

  31. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1, Equations and Initial Semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1985.

    Google Scholar 

  32. Greg Findlow and Jonathan Billington. High-level Nets for Dynamic Dining Philosophers Systems. In Proceedings of the International Workshop on Semantics for Concurrency, Leicester, UK, 23-25 July 1990, London, 1990. Springer-Verlag.

    Google Scholar 

  33. R.J. Fone. An analysis of a Numerical Petri Net description of ISDN call control procedures. Research Laboratories Report 7915, Telecom Australia, August 1988.

    Google Scholar 

  34. R.J. Fone. A Numerical Petri Net description of ISDN call control procedures. Research Laboratories Report 7914, Telecom Australia, August 1988.

    Google Scholar 

  35. H. J. Genrich and K. Lautenbach. The analysis of distributed systems by means of Predicate/Transition-nets. Lecture Notes in Computer Science, 70:123–146, 1979.

    Google Scholar 

  36. Hartmann J. Genrich. Predicate/Transition Nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and their Properties. Advances in Petri Nets 1986, Part 1: Proceedings of an Advanced Course, Bad Honnef, September 1986, pages 207–247, Berlin, February 1987. Springer-Verlag. Lecture Notes in Computer Science, Volume 254.

    Google Scholar 

  37. Hartmann J. Genrich and Kurt Lautenbach. System modelling with high-level Petri nets. Theoretical Computer Science, 13:109–136, 1981.

    Google Scholar 

  38. C. Girault, C. Chatelain, and S. Haddad. Specification and properties of a cache coherence protocol model. In G. Rozenberg, editor, Advances in Petri Nets 1987, pages 1–20. Springer-Verlag, Berlin, April 1987. Lecture Notes in Computer Science, Vol. 266.

    Google Scholar 

  39. A. Hopper and R.M. Needham. The Cambridge Fast Ring Networking System. IEEE Transactions on Computers, 37(10):1214–1223, October 1988. Earlier version published as University of Cambridge Computer Laboratory Technical Report, No. 90, June 1986.

    Google Scholar 

  40. P. Huber, K. Jensen, and R.M. Shapiro. Hierarchies in Coloured Petri Nets. In Proceedings of the 10th International Conference on Application and Theory of Petri Nets, pages 192–209, Bonn, West Germany, June 1989.

    Google Scholar 

  41. G.C. Illing. Automatic Petri-net based Protocol Implementation. In IREECON International, pages 358–361, Melbourne, September 1989.

    Google Scholar 

  42. Kurt Jensen. Coloured Petri Nets and the invariant-method. Theoretical Computer Science, 14:317–336, 1981.

    Google Scholar 

  43. Kurt Jensen. Coloured Petri Nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties. Advances in Petri Nets 1986, Part 1: Proceedings of an Advanced Course, Bad Honnef, September 1986, pages 248–299. Springer-Verlag, Berlin, February 1987. Lecture Notes in Computer Science, Vol. 254.

    Google Scholar 

  44. Kurt Jensen. Private communication, July 1988.

    Google Scholar 

  45. Kurt Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Volume 1: Basic Concepts, EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1992.

    Google Scholar 

  46. Kurt Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Volume 2: Analysis Methods, EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1994.

    Google Scholar 

  47. Kurt Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Volume 3: Practical Use, EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1997.

    Google Scholar 

  48. Jorgensen J.B., and Kristensen L.M., Design/CPN OEOS Graph Manual, University of Aarhus, 1996.

    Google Scholar 

  49. W. Jürgensen and S.T. Vuong. Formal specification and validation of ISO Transport Protocol components, using Petri nets. In ACM SIGCOMM '84 Symposium: Communications Architectures and Protocols, pages 75–82, Montréal, Canada, June 1984.

    Google Scholar 

  50. R.M. Keller. Formal verification of parallel programs. Communications of the ACM, 19(7):371–384, July 1976.

    Google Scholar 

  51. Bernd Kramer. Stepwise construction of non-sequential software systems using a net-based specification language. In G. Rozenberg, editor, Advances in Petri Nets 1984, pages 307–330. Springer-Verlag, Berlin, 1985. Lecture Notes in Computer Science, Vol. 188.

    Google Scholar 

  52. Bernd Krämer. SEGRAS — A Formal and Semigraphical Language combining Petri Nets and Abstract Data Types for the Specification of Distributed Systems. In Proceedings of the Ninth International Conference on Software Engineering, pages 116–125, Los Alamitos, California, March 1987. CS Press.

    Google Scholar 

  53. R.Y.L. Lai. Formal Specification and Verification of ISO FTAM Protocol. PhD thesis, Mathematical and Information Sciences, LaTrobe University, Melbourne, Australia, 1989.

    Google Scholar 

  54. J. Loeckx. Algorithmic specifications: A constructive specification method for abstract data types. ACM Transactions on Programming Languages and Systems, 9(4):646–685, October 1987.

    Google Scholar 

  55. P.M. Merlin. A study of the recoverability of computing systems. PhD thesis, Information and Computer Science Department, UC Irvine, 1974. Tech Report, No. 58.

    Google Scholar 

  56. J. Meseguer and U. Montanari. Petri nets are monoids: a new algebraic foundation for net theory. In Proceedings of the Third Annual Symposium on Logic in Computer Science, pages 155–164, Washington, DC, July 1988. IEEE Comp. Soc. Press.

    Google Scholar 

  57. Meta Software. Design/CPN Reference Manual. Meta Software Corporation, 1993.

    Google Scholar 

  58. J.D. Noe and G.J. Nutt. Macro E-Nets for Representation of Parallel Systems. IEEE Trans. Comput., C-22(8):718–727, August 1973.

    Google Scholar 

  59. G.J. Nutt. Evaluation nets for computer system performance analysis. In Proc FJCC, AFIPS, pages 279–286, Montvale, N.J., 1972. AFIPS Press.

    Google Scholar 

  60. W. Reisig. Petri Nets and Algebraic Specifications. SFB-Bericht 342/1/90 B, Technische Universität München, Institut für Informatik, München, West Germany, March 1990.

    Google Scholar 

  61. W. Reisig and J. Vautherin. An algebraic approach to high level Petri nets. In Proceedings of the Eighth European Workshop on Application and Theory of Petri Nets, pages 51–72, Zaragoza, Spain, 24–26 June 1987.

    Google Scholar 

  62. Wolfgang Reisig. Petri Nets, An Introduction, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1985.

    Google Scholar 

  63. F.J.W. Symons. Modelling and Analysis of Communication Protocols using Numerical Petri Nets. PhD thesis, University of Essex, 1978. Dept. of Elec. Eng. Sci. Telecommunication Systems Group Report No. 152, May 1978.

    Google Scholar 

  64. Tokmakoff, A. and Billington, J., Service Trading in Mobile Environments, In Proceedings of the International Conference on Information, Communications & Signal Processing: Trends in Information Systems Engineering and Wireless Multimedia Communications (ICICS'97), Singapore, 9–12 September 1997, IEEE Singapore Section, Volume 1 of 3, ISBN: 0-7803-3676-3, pp. 417–421.

    Google Scholar 

  65. Tokmakoff, A. and Billington, J., Reachability Analysis of the ODP Trader using Equivalence Classes, In Proceedings of the Software Engineering: Education & Practice Conference (SE:E&P'98), Dunedin, New Zealand, 26–29 January, 1998.

    Google Scholar 

  66. Turner K.J., editor. Using Formal Description Techniques — An Introduction to Estelle, LOTOS and SDL. John Wiley, New York, January 1993.

    Google Scholar 

  67. J. Vautherin. Parallel systems specifications with Coloured Petri Nets and algebraic specifications. In G. Rozenberg, editor, Advances in Petri Nets 1987, pages 293–308. Springer-Verlag, Berlin, April 1987. Lecture Notes in Computer Science, Vol. 266.

    Google Scholar 

  68. G. Wheeler, A. Valmari, and J. Billington. Baby TORAS eats Philosophers but thinks about Solitaire. In Proceedings of the Fifth Australian Software Engineering Conference ASWEC'90, pages 283–288, Sydney, Australia, 23–25 May 1990.

    Google Scholar 

  69. G. R. Wheeler. Numerical Petri Nets — a definition. Research Laboratories Report 7780, Telecom Australia, May 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Telecommunications Systems Engineering Centre Institute for Telecommunications Research, University of South Australia, Warrendi Road, 5095, Mawson Lakes, Adelaide, Australia

    Jonathan Billington

Authors
  1. Jonathan Billington
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Reisig Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Billington, J. (1998). Protocol specification using P-graphs, a technique based on coloured Petri Nets. In: Reisig, W., Rozenberg, G. (eds) Lectures on Petri Nets II: Applications. ACPN 1996. Lecture Notes in Computer Science, vol 1492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-65307-4_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-65307-4_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65307-3

  • Online ISBN: 978-3-540-49441-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation