Process periods and system reconstruction

  • Yuan Chong-Yi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 222)


It is a common practice in system design to build a system from its given behaviour. It is the general purpose in system analysis to get to know system behaviour from its structure. A common problem in both the two areas is how to specify. or to represent. system behaviour? This paper propose PROCESS PERIOD as the basic means of describing system behaviour, provided Petri Nets are used to model the system. A finite system can only have finite periods, and the total number of its periods is also finite. all processes. finite or not, can be constructed from, or decomposed into, periods.

Algorithm XY, contained in the appendix. is used to develop periods from a given system. The problem of constructing or reconstructing a system from the given behaviour is also discussed.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Best, A. Merceron, “D-Continuity: A Study in Relating System Properties to Process Properties” (1984), GMD report No. 83Google Scholar
  2. [2]
    E. Best, M. W. Shields, “Some Equivalence Results for Free Choice Nets and Simple Nets and On the Periodicity of Live Free Choice Nets” LNCS Vol. 156Google Scholar
  3. [3]
    W. Brauer (ed.), “Net Theory and Applications”, LNCS Vol. 84 (1980)Google Scholar
  4. [4]
    C. Fernandez, M. Nielsen, P. s. Thiagarajan, “A Note on Observable Occurrence Nets”, Proceedings of the Fifth European Workshop on Applications and Theory of Petri Nets, (1984)Google Scholar
  5. [5]
    J. L. Peterson, “Petri Nets” Computing Surveys Vol. 9, No. 3 (1977)Google Scholar
  6. [6]
    C. A. Petri, “Concurrency”, LNCS Vol. 84Google Scholar
  7. [7]
    W. Reisig, “Petri Nets”, Springer-Verlag (1985)Google Scholar
  8. [8]
    U.Goltz, W. Reisig, “The Non-sequential Behaviour of Petri Nets”, Information and Control (1983)Google Scholar
  9. [9]
    G. Winskel, “Events in Computation”, Ph.D. Thesis, University of Edinburg, Edinburg Great BritainGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Yuan Chong-Yi
    • 1
    • 2
  1. 1.Institute of Maths. Academia SinicaBeijingChina
  2. 2.GMD-F1Sankt AugustinGermany

Personalised recommendations