Skip to main content
SpringerLink
Log in
Book cover

International Conference on Application and Theory of Petri Nets

ICATPN 1996: Application and Theory of Petri Nets 1996 pp 289–306Cite as

Arc-typed Petri Nets

  • Full Papers
  • Conference paper
  • First Online:

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

Abstract

We formally introduce arc-typed nets as a model for causality based specifications. The new feature of arc-typed nets is the distinction of different arc-types; the different arc-types carry over to a process of the net. Therefore, there are different types of causalities in a run of an arc-typed net.

Arc-typed nets have informally been used for modelling and verifying consistency protocols. It turned out that arc-typed nets provide an adequate level of abstraction for these kind of applications. We demonstrate the application of arc-typed nets by specifying, modelling, and verifying a simple consistency protocol.

Supported by the Deutsche Forschungs Gemeinschaft, Projects: Verteilte Algorithmen and SFB 342 TP YE1.

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. J. K. Bennet, J.B. Carter, and W. Zwaenepoel. Munin: Distributed shared memory based on type-specific memory coherence. In 2nd ACM SIGPLAN Symposium on Principles and Practise of Parallel Programming. ACM March 1990.

    Google Scholar 

  2. Eike Best and César Fernández. Nonsequential Processes, EATCS Monographs on Theoretical Computer Science 13. Springer-Verlag, 1988.

    Google Scholar 

  3. Dominik Gomm and Ekkart Kindler. Causality based specification and correctness proof of a virtually shared memory scheme. SFB-Bericht 342/6/91 B, Technische Universität München, August 1991.

    Google Scholar 

  4. Dominik Gomm and Ekkart Kindler. A weakly coherent virtually shared memory scheme: Formal specification and analysis. SFB-Bericht 342/5/91 B, Technische Universität München, August 1991.

    Google Scholar 

  5. Dominik Gomm and Ekkart Kindler. Causality based proof of a distributed shared memory system. In A. Bode and M. Dal Cin, editors, Parallel Computer Architectures: Theory, Hardware, Software, Applications, LNCS 732, pages 131–149. Springer-Verlag, 1993.

    Google Scholar 

  6. Ursula Goltz and Wolfgang Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57:125–147, 1983.

    Google Scholar 

  7. Jeremy Gunawardena. Geometric logic, causality and event structures. In J. Baeten and J. Groote, editors, CONCUR '91, LNCS 527, pages 266–280. Springer-Verlag, 1991.

    Google Scholar 

  8. Jeremy Gunawardena. Causal automata. Theoretical Computer Science, 101:265–288, 1992.

    Google Scholar 

  9. Kurt Jensen. Coloured Petri Nets, Volume 1: Basic Concepts. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1992.

    Google Scholar 

  10. Kurt Jensen. Coloured Petri Nets, Volume 2: Analysis Methods. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1995.

    Google Scholar 

  11. Joost-Pieter Katoen. Causal behaviours and nets. In Giorgio De Michelis and Michel Diaz, editors, Application and Theory of Petri Nets 1995, LNCS 935, pages 258–277. Springer-Verlag, June 1995.

    Google Scholar 

  12. Ekkart Kindler, Andreas Listl, and Rolf Walter. Kausalitätsbasierte Beweismethoden für parallele Datenbanksysteme: Eine Fallstudie. Informatik-Berichte 30, Humboldt-Universität zu Berlin, Institut für Informatik, June 1994.

    Google Scholar 

  13. Ekkart Kindler, Andreas Listl, and Rolf Walter. A specification method for transaction models with data replication. Informatik-Berichte 56, Humboldt-Universität zu Berlin, March 1996.

    Google Scholar 

  14. Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.

    Google Scholar 

  15. Wolfgang Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80:1–34, May 1991.

    Google Scholar 

  16. Einar Smith and Wolfgang Reisig. The semantics of a net is a net, an exercise in general net theory. In K. Voss, H.J. Genrich, and G. Rozenberg, editors, Concurrency and Nets. Springer-Verlag, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, D-10099, Berlin

    Ekkart Kindler & Rolf Walter

Authors
  1. Ekkart Kindler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf Walter
    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

Kindler, E., Walter, R. (1996). Arc-typed Petri 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_16

Download citation

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

  • 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