Skip to main content
SpringerLink
Log in

A formal definition of hierarchical predicate transition nets

  • Full Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1996 (ICATPN 1996)

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

Included in the following conference series:

Abstract

Hierarchical predicate transition nets have recently been introduced as a visual formalism for specifying complex reactive systems. They extend predicate transition nets with hierarchical structures so that large systems can be specified and understood stepwisely, and thus are more suitable for real-world applications. In this paper, we provide a formal syntax and an algebraic semantics for hierarchical predicate transition nets, which establish the theory of hierarchical predicate transition nets for precise specification and formal reasoning.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Billington, G.R. 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, vol.14, no.3, 1988, 301–316.

    Google Scholar 

  2. H. Ehrig and B. Mahr, Fundamentals of Algebraic Specification 1, Springer-Verlag, 1985.

    Google Scholar 

  3. H. Ehrig and B. Mahr, Fundamentals of Algebraic Specification 2, Springer-Verlag, 1990.

    Google Scholar 

  4. R. Fehling, A concept of hierarchical Petri nets with building blocks, Lecture Notes in Computer Science, vol. 674, 1993, 148–168.

    Google Scholar 

  5. H.J. Genrich, and K. Lautenbach, System modeling with high-level Petri nets. Theoretical Computer Science, vol.13, 1981, 109–136.

    Google Scholar 

  6. D. Harel, On visual formalisms. Communications of the ACM, vol. 31, 1988, 514–530.

    Google Scholar 

  7. X. He, Integrating formal specification and verfication methods in software development, Ph.D. dissertation, Virginia Polytechnic Institute & State University, June, 1989.

    Google Scholar 

  8. X. He, A method for analysing properties of hierarchical predicate transition nets, Proceedings of the 19th Annual International Computer Software & Applications Conference (COMPSAC'95), Dallas, TX, August, 1995, 50–55.

    Google Scholar 

  9. D. Harel, and C.-A. Kahana, On statecharts with overlapping. ACM Transactions on Software Engineering and Methodology, vol.1, no.4, 1992, 399–421.

    Google Scholar 

  10. X. He, and J.A.N. Lee, A methodology for constructing predicate transition net specifications. Software — Practice and Experience, vol.21, no.8, 1991, 845–875.

    Google Scholar 

  11. X. He, and C.H. Yang, Structured analysis using hierarchical predicate transition nets. Proc. of the 16th Int'l Computer Software and Applications Conference (COMPSAC92), Chicago, 1992, 212–217.

    Google Scholar 

  12. P. Huber, K. Jensen, and R.M. Shapiro, Hierarchies in colored Petri nets. Lecture Notes in Computer Science, vol.483, Spriner-Verlag, 1990, 313–341.

    Google Scholar 

  13. K. Jensen, Colored Petri nets and the invariant method. Theoretical Computer Science, vol.14, 1981, 317–336.

    Google Scholar 

  14. K. Jensen, Colored Petri nets: a high level language for system design and analysis, Lecture Notes in Computer Science, vol. 483, 1990, 342–416.

    Google Scholar 

  15. K. Jensen, Colored Petri Nets, vol.1, Springer-Verlag, 1992.

    Google Scholar 

  16. C. Kan and X. He, High-level algebraic Petri nets, Information and Software Technology, vol.37, no.l, 1995, 23–30.

    Google Scholar 

  17. Z. Manna and A. Pnueli, Completing the temporal picture, Theoretical Computer Science, vol. 83, pp.97–130, 1991.

    Google Scholar 

  18. Z. Manna and A. Pnueli, Models for reactivity, Acta Informatica, vol.30, pp.609–678, 1993.

    Google Scholar 

  19. W. Reisig, Petri Nets — An Introduction. EATCS Monographs on Theoretical Computer Science, vol.4, Springer-Verlag, 1985.

    Google Scholar 

  20. W. Reisig, Petri nets in software engineering. Lecture Notes in Computer Science, vol.255, Springer-Verlag, 1987, 63–96.

    Google Scholar 

  21. W. Reisig, Petri nets and algebraic specifications. Theoretical Computer Science, vol.80, 1991, 1–34.

    Google Scholar 

  22. E. Yourdon, Modern Structured Analysis, Yourdon Press, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, North Dakota State University, 58105, Fargo, ND, USA

    Xudong He

Authors
  1. Xudong He
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jonathan Billington Wolfgang Reisig

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

He, X. (1996). A formal definition of hierarchical predicate transition nets. In: Billington, J., Reisig, W. (eds) Application and Theory of Petri Nets 1996. ICATPN 1996. Lecture Notes in Computer Science, vol 1091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61363-3_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-61363-3_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68505-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation