Skip to main content
SpringerLink
Log in

Free choice systems have home states

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

This paper contains a proof that live and safe free choice Petri nets have home states. Home states are ones which can be reached from every successor state of the initial state. Liveness means that all actions remain executable, and safeness means that all capacities are finite. The result is interesting because it may help in the analysis of behavioural properties of complex systems. The existence of home states is a strong property which (as we will also show) fails to hold for a slightly generalised class of nets.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berthelot, G., Terrat, R.: Petri nets for the correctness of protocols. IEEE Trans. Comm. 30, 2497–2505 (1982)

    Google Scholar 

  2. Best, E.: Adequacy properties of path programs. Theor. Comput. Sci. 18, 149–171 (1982)

    Google Scholar 

  3. Best, E.: Relational semantics of concurrent programs (with some applications). In: Formal description of programming concepts II (D. Bjørner, ed.), pp. 431–452. Amsterdam: North Holland 1983

    Google Scholar 

  4. Best, E., Shields, M.W.: Some equivalence results on free choice nets and simple nets and on the periodicity of live and safe free choice nets. Proc. CAAP'83, Lecture Notes in Computer Science, Vol. 159, pp. 141–154. Berlin-Heidelberg-New York: Springer 1983

    Google Scholar 

  5. Genrich, H.J., Lautenbach, K., Thiagarajan, P.S.: Elements of General Net Theory. In: Net theory and applications. (W. Brauer, ed.), Lecture Notes in Computer Science, Vol. 84, pp. 21–163. Berlin-Heidelberg-New York: Springer 1980

    Google Scholar 

  6. Commoner, F., Holt, A.W., Even, S., Pnueli, A.: Marked directed graphs. J. Comput. System Sci. 5, 511–523 (1971)

    Google Scholar 

  7. Genrich, HJ., Lautenbach, K.: Synchronisationsgraphen. Acta Informat. 2, 143–161 (1973)

    Google Scholar 

  8. Genrich, H.J., Thiagarajan, P.S.: A theory of bipolar synchronisation schemes. Computer Science Department, University of Aarhus (1983). Also to appear in TCS

  9. Hack, M.H.T.: Analysis of production schemata by Petri nets. TR-94, MIT, Boston (1972). Corrected June 1974

    Google Scholar 

  10. Keller, R.: Formal verification of parallel programs. Comm. ACM 19, 371–387 (1976)

    Google Scholar 

  11. Shields, M.W.: On the non-sequential behaviour of systems possessing a generalised free choice property. Internal Report CRS-92-81, Edinburgh University (1981). Also to appear in TCS

  12. Thiagarajan, P.S., Voss, K.: In praise of free choice nets. Proc. 4th Petri Net Workshop, pp. 322–341, Toulouse (1983)

  13. Thiagarajan, P.S., Voss, K.: A fresh look at free choice nets. Arbeitspapiere der GMD No. 58, St. Augustin (1983)

Download references

Author information

Authors and Affiliations

  1. Gesellschaft für Mathematik und Datenverarbeitung, Schloß Birlinghoven, Postfach 1240, 5205, St. Augustin 1, Germany

    Eike Best & Klaus Voss

Authors
  1. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus Voss
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Best, E., Voss, K. Free choice systems have home states. Acta Informatica 21, 89–100 (1984). https://doi.org/10.1007/BF00289141

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation