On the invariants of coloured Petri Nets
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.
KeywordsIncidence Matrix Concurrent System Data Base System Message Buffer Place Invariant
Unable to display preview. Download preview PDF.
- 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.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
- 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
- 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.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.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