Advertisement

On the invariants of coloured Petri Nets

  • Y. Narahari
  • N. Viswanadham
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 222)

Abstract

In this paper, we develop a theorem that enables computation of the place invariants of the union of a finite collection of coloured Petri Nets when the individual nets satisfy certain conditions and their invariants are known. We consider the illustrative examples of the Readers-Writers problem, a resource sharing system, and a network of databases and show how this theorem is a valuable tool in the analysis of concurrent systems.

Keywords

Incidence Matrix Concurrent System Data Base System Message Buffer Place Invariant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. Agerwala and Y.C. Amphai, ‘A Synthesis Rule for Concurrent Systems', Proceedings of IEEE Conference on Design Automation, 1978, pp. 305–311.Google Scholar
  2. 2.
    H.J. Genrich and K. Lautenbach, ‘The Analysis of distributed systems by predicate/transition nets', Semantics of Concurrent Computation, Evian 1979, G. Kahn (ed.), Lecture Notes in Computer Science, Vol.70, Springer verlag 1979, pp. 123–146.Google Scholar
  3. 3.
    H.J. Genrich and K. Lautenbach, ‘System Modelling with High-Level Petri Nets', Theoretical Computer Science, Vol.13, 1981, pp. 109–136, North-Holland Publishing Company.CrossRefGoogle Scholar
  4. 4.
    M. Jantzen and R. Valk, ‘Formal Properties of Place/Transition Nets', Net Theory and Applications, Hamburg 1979, W. Brauer (ed.), Lecture Notes in Computer Science, Vol.84, Springer-Verlag 1980, pp. 165–212.Google Scholar
  5. 5.
    K. Jensen, ‘Coloured Petri Nets and the Invariant Method', Theoretical Computer Science, Vol.14, 1981, pp. 317–336, North-Holland Publishing Company.CrossRefGoogle Scholar
  6. 6.
    K. Jensen, ‘How to find Invariants for Coloured Petri Nets', Mathematical Foundations of Computer Science, 1981, J. Gruska and M. Chytil (eds.), Lecture Notes in Computer Science, Vol.118, Springer-Verlag 1981, pp. 327–338.Google Scholar
  7. 7.
    G. Memmi and G. Roucairol, ‘Linear Algebra in Net Theory', Net Theory and Applications, Hamburg 1979, W. Brauer (ed.), Lecture Notes in Computer Science, Vol.84, Springer-Verlag 1980, pp. 213–224.Google Scholar
  8. 8.
    Y. Narahari and N. Viswanadham, ‘A Petri Net Approach to the modelling and analysis of Flexible manufacturing systems', To appear in: Annals of Operations Research, Vol.3, 1986.Google Scholar
  9. 9.
    J.L. Peterson, ‘Petri Nets', ACM Computing Surveys, Vol.9, No.3, September 1977, pp. 223–252.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Y. Narahari
    • 1
  • N. Viswanadham
    • 1
  1. 1.School of AutomationIndian Institute of ScienceBangaloreINDIA

Personalised recommendations