Title :
Some algebraic considerations for efficient computations in timed Petri nets
Author_Institution :
Inst. Nat. de Recherche en Inf. et Autom., Sophia-Antipolis, France
Abstract :
We show how structural properties of some classes of timed Petri nets can be used to derive efficient algorithms to compute important quantities such as total number of firings, average number of tokens in places or stability conditions
Keywords :
Petri nets; algebra; discrete systems; large-scale systems; parallel algorithms; stability; timing; virtual machines; algebraic considerations; average token number; efficient algorithms; efficient computations; stability conditions; structural properties; timed Petri nets; total firing number; Computational Intelligence Society; Computational modeling; Concurrent computing; Equations; Fires; Fluid dynamics; Parallel algorithms; Petri nets; Stability; Statistics;
Conference_Titel :
System Sciences, 1996., Proceedings of the Twenty-Ninth Hawaii International Conference on ,
Conference_Location :
Wailea, HI
Print_ISBN :
0-8186-7324-9
DOI :
10.1109/HICSS.1996.495491
