Skip to main content

Advertisement

Springer Nature Link
Log in

Fifo nets without order deadlock

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We introduce a generalisation of free choice nets to fifo. These fifo nets are free from deadlocks caused by the order of messages in fifo queues. We describe some tools for their analysis, using the fact that they are weakly monotonous, and that there is a narrow relation between their languages and those of the associated coloured nets. Therefore, quasi-liveness, finite termination and liveness are decidable properties.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Best, E., Fernandez, C.: Notations and terminology on Petri nets. Arbeitspapiere der GMD 195, 1986

  2. Choquet, A., Finkel, A.: Applications of residues for the analysis of parallel systems communicating by fifo channels. LRI Repport no. 278, Univ. Paris Sud, Orsay, May 1986

    Google Scholar 

  3. Commoner, F.: Deadlock in Petri nets. Applied Data Research Inc., Wakefield Mass CA, pp. 7206–2311, 1972

    Google Scholar 

  4. Finkel, A.: Deux classes de réseaux à files: les réseaux monogènes et les réseaux préfixes. Thèse de 3ème cycle, LITP Repport no. 83-3, 1982

  5. Finkel, A.: Boundeness and liveness for monogeneous fifo nets and for free choice fifo nets — Application to analysis of protocols. LRI Repport no. 205, 1985

  6. Finkel, A.: Structuration des systèmes de transitions: applications au contrôle du parallélisme par files fifo. Thèse d'Etat, Université Paris Sud, 1986

  7. Flé, M., Roucairol, G.: Fair serializability of iterated transactions using fifo-nets. Advances in Petri nets. In: Lecture Notes of Computer Science, Vol. 188. Rozenberg, G. (ed.), pp. 154–168. Berlin, Heidelberg, New York, Tokyo: Springer 1985

    Google Scholar 

  8. Hack, M.: Analysis of production schemata by Petri nets. M.S. Thesis, Dept. Elect. Eng. M.I.T. Camb. Mass. Proj. MAC.MAC.TR 94 (September 1972)

  9. Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 2 (1952)

  10. Jensen, K.: High-level Petri nets. Advanced course on Petri nets, Bad Honnef, 1986

  11. Kahn, G., Mac Quenn, D.: Coroutines and networks of parallel processes. In: IFIP 77 Inf. Proc. Conf. 1977

  12. Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: Proc. 14th Ann. ACM Symp. Theory Comput. 1982

  13. Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: SIAM J. Comput. 13, 441–460 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  14. Memmi, G., Finkel, A.: An introduction to fifo nets — monogeneous nets: a subclass of fifo nets. T.C.S. 35, 191–214 (1985)

    MathSciNet  MATH  Google Scholar 

  15. Valk, R., Jantzen, M.: The residues of vector sets with applications to decidability problem in Petri nets. Acta Inf. 21, 643–674 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  16. Vauquelin, B., Franchi-Zannettaci, P.: Automates à files. T.C.S. 11, 221–225 (1980)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Paris sud, L.R.I Bat. 490, F-91405, Orsay Cedex, France

    Alain Finkel & Annie Choquet

Authors
  1. Alain Finkel
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Annie Choquet
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Finkel, A., Choquet, A. Fifo nets without order deadlock. Acta Informatica 25, 15–36 (1988). https://doi.org/10.1007/BF00268843

Download citation

  • Received:

  • Issue Date:

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

Keywords