Skip to main content
SpringerLink
Log in
Book cover

International Conference on Application and Theory of Petri Nets

ICATPN 1993: Application and Theory of Petri Nets 1993 pp 433–452Cite as

Bridging the gap between place- and Floyd-invariants with applications to preemptive scheduling

  • Full Papers
  • Conference paper
  • First Online:

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

Abstract

The notion of linear place-invariants for coloured nets is extended to sums of non-linear functions. The extension applies to such places where all tokens are removed by the occurrence of an output transition. It is shown how this covers the case of variable assignments and invariants in traditional programs. The result helps in understanding the relation of place-invariants of coloured nets in comparison with traditional Floyd-invariants of programs. In the second part the property of token clearing is introduced to the occurrence rule, showing that the results of the first part are still valid. Such types of nets are important for the modelling of fault tolerant applications.

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. Floyd, R.: Assigning meaning to programs. Mathematical Aspects of Computer Science, XIX American Mathematical Society (1967), 19–32

    Google Scholar 

  2. Gries, D.: The Science of Programming, Springer, Berlin 1981

    Google Scholar 

  3. Hoare, C.A.R.: An axiomatic approach to computer programming, Comm. ACM 12(1969), 576–580,583

    Google Scholar 

  4. Jensen, K.: Coloured Petri Nets and the invariant method. Theoretical Computer Science 14(1981), 317–336

    Google Scholar 

  5. Jensen, K.: Coloured Petri Nets, in Petri Nets: Central Models and Their Properties, in Brauer, W. et al. (Eds), Lecture Notes in Computer Science No 254, Springer, Berlin 1987, 248–299

    Google Scholar 

  6. Valk, R.: Selfmodifying Nets, a Natural Extension of Petri Nets, Lecture Notes in Computer Science No 62, Springer, Berlin 1978, 464–476

    Google Scholar 

  7. Valk, R.: Facts in Place/Transition Nets with Unrestricted Capacities, Annales Univ. Scie. Budapestensis R. Eötvös, Sect. Comput. Tom. IV, 1983, 97–105

    Google Scholar 

  8. Valk, R.: Extending S-invariants for Coloured and Selfmodifying Nets, Techn. Report,Univ. Hamburg, Dep. of Computer Science, 1993

    Google Scholar 

  9. Vautherin, J.: Non-linear invariants for safe coloured nets and appli cation to the proof of parallel programs, Proc. 6th European Workshop on Applications and Theory of Petri Nets, Espoo, Finland, 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Vogt-Kölln-Str. 30, D-2000, Hamburg 54

    Rüdiger Valk

Authors
  1. Rüdiger Valk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marco Ajmone Marsan

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valk, R. (1993). Bridging the gap between place- and Floyd-invariants with applications to preemptive scheduling. In: Ajmone Marsan, M. (eds) Application and Theory of Petri Nets 1993. ICATPN 1993. Lecture Notes in Computer Science, vol 691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56863-8_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-56863-8_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56863-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation