Abstract
We show that timed nets under the earliest firing rule can be transformed equivalently to Petri nets working under the maximum firing strategy. Additionally, we give two sufficient conditions for live Petri nets to remain live under any timing.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
5. References
H.-D. Burkhard: Ordered Firings in Petri Nets. EIK 17 (1981) 2/3, 71–86.
M.A. Holliday, M.K. Vernon: A Generalized Timed Petri Net Model for Performance Analysis. International Workshop on Timed Nets, Torino 1985, Computer Society Press, 181–190.
M. Jantzen, R. Valk: Formal Properties of Place/Transition Nets. LNCS 84, 165–212.
W. Reisig: Deterministic Buffer Synchronization of Sequential Machines. Acta Informatica 18 (1982) 117–134.
S. Sandring, P.H. Starke: A Note on Liveness in Petri Nets. Fundamenta Informaticae V.2 (1982) 217–232.
M. Heiner: Petri net based verification of communication protocols specified by language means. iir (informatik-informationen-reporte) no.2/1989, IIR der AdW der DDR.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Starke, P.H. (1990). Some properties of timed nets under the earliest firing rule. In: Rozenberg, G. (eds) Advances in Petri Nets 1989. APN 1988. Lecture Notes in Computer Science, vol 424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52494-0_39
Download citation
DOI: https://doi.org/10.1007/3-540-52494-0_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52494-6
Online ISBN: 978-3-540-46998-8
eBook Packages: Springer Book Archive