skip to main content
article
Free Access

The derivation of performance expressions for communication protocols from timed petri net models

Authors Info & Claims
Published:01 June 1984Publication History
Skip Abstract Section

Abstract

Petri Net models have been extended in a variety of ways and have been used to prove the correctness and evaluate the performance of communication protocols. Several extensions have been proposed to model time. This work uses a form of Timed Petri Nets and presents a technique for symbolically deriving expressions, which describe system performance. Unlike past work on performance evaluation of Petri Nets which assumes a priori knowledge of specific time delays, the technique presented here applies to a wide range of time delays so long as the delays satisfy a set of timing constraints. The technique is demonstrated using a simple communication protocol.

References

  1. 1 Berthomieu, B., and M. Menasche, "An Enumerative Approach for Analyzing Time Petri Nets" Proceedings of the 1983 IFIP Congress, Paris, (Sept. 1983).Google ScholarGoogle Scholar
  2. 2 Berthelot, G. and Richard Terrat, "Petri Net Theory for the Correctness of Protocols," Protocol Specification, Testing and Verification, G. Sunshine (ed.), North-Holland Pub. Co., (1982). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Bochmann, G.V., "A General Transition Model of Protocols and Communication Services," IEEE Transactions on Communication COM-28,4 (April 1980), pp. 645-650.Google ScholarGoogle Scholar
  4. 4 Coolahan, J.E., and N. Roussopoulos, "Timing Requirements for Time-Driven Systems Using Augmented Petri Nets" IEEE Transactions on Software Engineering, SE-9,5 (Sept. 1983), pp. 603-616.Google ScholarGoogle Scholar
  5. 5 Hailpern, B. and S. Owicki, "Verifying Network Protocols Using Temporal Logic", Proceedings of Trends and Applications Symposium, 1980, Computer Network Protocols National Bureau of Standards, Maryland, (May 1980).Google ScholarGoogle Scholar
  6. 6 Merlin, P. and D. Farber, "A Methodology for the Design and Implementation of Communications Protocols," IEEE Transactions on Communications, COM-24, 6 (June 1976).Google ScholarGoogle Scholar
  7. 7 Molloy, M. "On the Integration of Delay and Throughput Measures in Distributed Processing Models", Computer Science Dept., University of California, Los Angeles, Report No. CSD-810921, September 1981.Google ScholarGoogle Scholar
  8. 8 Razouk, R.R., and G. Estrin "Modeling and Verification of Communication Protocols: The X.21 Interface" IEEE Transactions on Computers, C-29,12 (December 1980), pp. 1038-1052.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Ramamoorthy C.V. and G.S. Ho, "Performance Evaluation of Asynchronous Concurrency Systems using Petri Nets," IEEE Transactions on Software Engineering, SE-6, 5 (September 1980), 440-449.Google ScholarGoogle Scholar
  10. 10 Ramchandani, C. "Analysis of Asynchronous Concurrent Systems by Timed Petri Nets," Ph.D. Thesis, MIT 1974, Project Mac Report No. MAC-TR-120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Razouk, R.R., and C. Phelps "Performance Analysis Using Timed Petri Nets", Tech. Rept. 206, University of California, Irvine, (1983). (Submitted to 4th Int. Conf. on Distributed Computing Systems, May 1984).Google ScholarGoogle Scholar
  12. 12 Sabnani, K. and M. Schwartz, "Verification of a Multidestination Protocol Using Temporal Logic", Protocol Specification, Testing and Verification, C Sunshine (ed.) North-Holland Pub. Co., (1982). Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Sifakis, J. "Petri Nets for Performance Evaluation," Measuring, Modelling and Evaluating Computer Systems, Proceedings of the 3rd International Symposium, IFIP Working Group 7.3, H. Beilner and E. Gelenbe (eds.), North-Holland Pub. Co. (1977), pp. 75-93. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 Simon, G. and D. Kaufman, "An Extended Finite State Machine Approach to Protocol Specification," Protocol Specification, Testing and Verification, C. Sunshine (ed.), North-Holland Pub. Co. (1982). Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 Symons, F.J.W., "Verification of Communication Protocols using Numerical Petri Nets," Australian Telecommunication Research, 14,1 (1980) 34-38.Google ScholarGoogle Scholar
  16. 16 Teng, A.Y., and M.T. Liu, "A Formal Approach to the Design and Implementation of Network Communication Protocol," Proceedings of COMPSAC, (May 1980), pp. 722-727.Google ScholarGoogle Scholar
  17. 17 Vernon, M.K., E. de Souza e Silva, and G. Estria "Performance Evaluation of Asynchronous Concurrent Systems: The UCLA Graph Model of Behavior" 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation, College Park, Maryland, May 25-27, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 Yelowits, L., S. Gerhart, and G. Hilborn, "Modeling a Network Protocol in Affirm and Ada", Protocol Specification, Testing and Verification, C. Sunshine (ed.), North-Holland Pub. Co., (1982). Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19 Zuberek, W.M., "Timed Petri Nets and Preliminary Performance Evaluation," 7th Annual Symposium on Computer Architecture, (1980), pp. 88-96. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The derivation of performance expressions for communication protocols from timed petri net models

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in

                Full Access

                • Published in

                  cover image ACM SIGCOMM Computer Communication Review
                  ACM SIGCOMM Computer Communication Review  Volume 14, Issue 2
                  June 1984
                  245 pages
                  ISSN:0146-4833
                  DOI:10.1145/639624
                  Issue’s Table of Contents

                  Copyright © 1984 ACM

                  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 1 June 1984

                  Check for updates

                  Qualifiers

                  • article

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader