Skip to main content
SpringerLink
Log in

A memory module specification using composable high-level petri nets

  • Conference paper
  • First Online:
Formal Systems Specification

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

Abstract

This paper describes a solution of the RPC-memory specification problem defined by M. Broy and L. Lamport on the occasion of a Dagstuhl seminar in 1994. The approach is based on a recently developed model of composable high-level Petri nets called M-nets, on which CCS-like composition operations such as parallel composition, restriction and transition synchronisation are defined. Correctness proofs are given in terms of interface transition trace inclusion.

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. B. Berthomieu and M. Diaz: Modeling and Verification of Time Dependent Systems Using Time Petri Nets. IEEE Transactions on Software Engineering Vol. 17/3, 259–273 (1991).

    Article  Google Scholar 

  2. E. Best and R. Devillers: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science Vol. 55/1, 87–136 (1988).

    Google Scholar 

  3. E. Best, R. Devillers and J.G. Hall: The Petri Box Calculus: a New Causal Algebra with Multilabel Communication. Advances in Petri Nets 1992 (ed. G.Rozenberg), Springer-Verlag, LNCS Vol. 609, 21–69 (1992).

    Google Scholar 

  4. E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel and E. Pelz: A Class of Composable High Level Petri Nets. Proceedings of Petri Nets'95, Torino, G. De Michelis, M. Diaz (eds), Springer-Verlag, LNCS Vol.935, 103–120 (1995).

    Google Scholar 

  5. E. Best and Th. Thielke: Coloured Nets with Curry. Petri Net Newsletters No. 50, 27–44 (1996).

    Google Scholar 

  6. M. Broy and L. Lamport: The RPC-Memory Specification Problem. This volume.

    Google Scholar 

  7. A. Cerone and A. Maggiolo-Schettini: Time-based Expressivity of Timed Petri Nets. TR 12/95, Goethe-Universität, Frankfurt am Main (1995).

    Google Scholar 

  8. H.J. Genrich: Predicate-transition Nets. Advances in Petri Nets 1986, Springer-Verlag, LNCS Vol.254, 207–247 (1987).

    Google Scholar 

  9. H.J. Genrich: Equivalence Preserving Transformations of Predicate-transition Nets, Arbeitspapiere der GMD (1987).

    Google Scholar 

  10. U. Goltz and W. Reisig: The Non-sequential Behaviour of Petri Nets. Information and Control Vol. 57/2-3, 125–147 (1983).

    Article  Google Scholar 

  11. K. Jensen: Colored Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1. EATCS Monographs on Theoretical Computer Science, 1992.

    Google Scholar 

  12. H. Klaudel: Modèles algébriques, basés sur les réseaux de Petri, pour la sémantique des langages de programmation concurrents. PhD Thesis, Université Paris-Sud, Orsay, 1995.

    Google Scholar 

  13. H. Klaudel, R.-C. Riemann and A. Gronewold: Consistent Equivalence Notion for a Class of High Level Petri Nets. Rapport de Recherche 1054, LRI, Université Paris Sud (June 1996).

    Google Scholar 

  14. A. Mazurkiewicz: Concurrent Program Schemes and Their Interpretation. University of Århus, Computer Science Department, DAIMI PB-78 (1977).

    Google Scholar 

  15. P.M. Merlin and D.J. Farber: Recoverability of Communication Protocols — Implication of a Theoretical Study. IEEE Transactions on Software Communications 24, 1036–1043 (1976).

    Article  Google Scholar 

  16. A.J.R.G. Milner: Communication and Concurrency. Prentice Hall (1989).

    Google Scholar 

  17. E.R. Olderog: Nets, Terms and Formulas. Cambridge Tracts in Theoretical Computer Science Vol. 23 (1991).

    Google Scholar 

  18. L. Popova: On Time Petri Nets. Journal of Information Processing and Cybernetics (formerly EIK), Vol. 27/4, 227–244 (1991).

    Google Scholar 

  19. V.R. Pratt: The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial. Springer-Verlag, LNCS Vol. 197: Seminar on Concurrency, S.D. Brookes, A.W. Roscoe, G. Winskel (eds), 180–196 (1985).

    Google Scholar 

  20. W. Reisig: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science Vol. 4 (1985).

    Google Scholar 

  21. P.H. Starke: Analyse von Petri-Netz-Modellen. Verlag Teubner, Stuttgart (1990).

    Google Scholar 

  22. P.H. Starke: A Memo on Time Constraints in Petri Nets. Informatik-Bericht Nr. 46, Humboldt-Universität zu Berlin (August 1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Hildesheim, Marienburger Platz 22, D-31141, Hildesheim

    Eike Best

Authors
  1. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Broy Stephan Merz Katharina Spies

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Best, E. (1996). A memory module specification using composable high-level petri nets. In: Broy, M., Merz, S., Spies, K. (eds) Formal Systems Specification. Lecture Notes in Computer Science, vol 1169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024428

Download citation

  • DOI: https://doi.org/10.1007/BFb0024428

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61984-0

  • Online ISBN: 978-3-540-49573-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation