Skip to main content
SpringerLink
Log in

Process periods and system reconstruction

  • Conference paper
  • First Online:
Advances in Petri Nets 1985 (APN 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 222))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Best, A. Merceron, “D-Continuity: A Study in Relating System Properties to Process Properties” (1984), GMD report No. 83

    Google Scholar 

  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. 156

    Google Scholar 

  3. W. Brauer (ed.), “Net Theory and Applications”, LNCS Vol. 84 (1980)

    Google Scholar 

  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. J. L. Peterson, “Petri Nets” Computing Surveys Vol. 9, No. 3 (1977)

    Google Scholar 

  6. C. A. Petri, “Concurrency”, LNCS Vol. 84

    Google Scholar 

  7. W. Reisig, “Petri Nets”, Springer-Verlag (1985)

    Google Scholar 

  8. U.Goltz, W. Reisig, “The Non-sequential Behaviour of Petri Nets”, Information and Control (1983)

    Google Scholar 

  9. G. Winskel, “Events in Computation”, Ph.D. Thesis, University of Edinburg, Edinburg Great Britain

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Maths. Academia Sinica, Beijing, China

    Yuan Chong-Yi

  2. GMD-F1, Sankt Augustin, Germany

    Yuan Chong-Yi

Authors
  1. Yuan Chong-Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chong-Yi, Y. (1986). Process periods and system reconstruction. In: Rozenberg, G. (eds) Advances in Petri Nets 1985. APN 1985. Lecture Notes in Computer Science, vol 222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016209

Download citation

  • DOI: https://doi.org/10.1007/BFb0016209

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16480-7

  • Online ISBN: 978-3-540-39822-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation