Some properties of timed nets under the earliest firing rule

  • Peter H. Starke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 424)


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.


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. Bu[1981]
    H.-D. Burkhard: Ordered Firings in Petri Nets. EIK 17 (1981) 2/3, 71–86.Google Scholar
  2. HV[1985]
    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.Google Scholar
  3. JV[1980]
    M. Jantzen, R. Valk: Formal Properties of Place/Transition Nets. LNCS 84, 165–212.Google Scholar
  4. Re[1982]
    W. Reisig: Deterministic Buffer Synchronization of Sequential Machines. Acta Informatica 18 (1982) 117–134.Google Scholar
  5. SS[1982]
    S. Sandring, P.H. Starke: A Note on Liveness in Petri Nets. Fundamenta Informaticae V.2 (1982) 217–232.Google Scholar
  6. He[1989]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Peter H. Starke
    • 1
  1. 1.Sektion Mathematik der Humboldt-UniversitaetBerlin

Personalised recommendations