Skip to main content
Springer Nature Link
Log in

Testing for unboundedness of Fifo channels

  • Concurrency I
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

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

Included in the following conference series:

Abstract

Unsolvability of the unboundedness problem for specification models allowing Fifo channels was proved a few years ago by Brand and Zafiropulo. The paper investigates a testing approach of that problem. Instead of reducing the model in order to give decidability results, we work with the largest possible framework and find a sufficient condition for unboundedness based on a relation between the nodes of the reachability tree. The construction of the resulting reduced tree can then be applied as well to communicating finite state machines as to Fifo-Nets. Moreover, the test extends existing decidability results. A few modifications of the relation make it available for Estelle specifications.

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. G. Bochmann. Finite state description of communication protocols. Computer Networks, 2, October 1978.

    Google Scholar 

  2. D. Brand and P. Zafiropulo. On communicating finite-state machines. Tech Rep. RZ 1053, IBM Zurich Research Lab., Ruschlikon, Switzerland, Jan. 1981.

    Google Scholar 

  3. D. Brand and P. Zafiropulo. On communicating finite-state machines. J.A.C.M, 2:323–342, April 1983.

    Google Scholar 

  4. A. Choquet and A. Finkel. Simulation of linear fifo nets by petri nets having a structured set of terminal markings. In Proceedings of the 8 th European Workshop on Applications and Theory of Petri Nets, Zaragoza, Spain, June 1987.

    Google Scholar 

  5. A. Finkel. A generalization of the procedure of Karp and Miller to well structured transition systems. In 14th ICALP, Karlsruhe, RFA, July 1987.

    Google Scholar 

  6. A. Finkel. A new class of analysable cfsms with unbounded fifo channels: application to communication protocol and distributed solution of the mutual exclusion problem. In VIII IFIP Symposium, WG 61, Atlantic City, June 1988.

    Google Scholar 

  7. A. Finkel. Structuration des systèmes de transitions. Applications au contrôle de parallélisme par files fifo. Thèse d'état, Juin 1986.

    Google Scholar 

  8. A. Finkel and L. Rosier. A survey on decidability questions for classes of fifo nets. Rapport de recherche 456, L.R.I., Nov. 1988.

    Google Scholar 

  9. M. Gouda, E. Gurari, T. Lai, and L. Rosier. On deadlock detection in systems of communicating finite state machines. Computers and Artificial Intelligence, 6(3):209–228, 1987.

    Google Scholar 

  10. M. Gouda and L. Rosier. On deciding progress for a class of communicating protocols. In Proceedings of the Eighteenth Annual Conference on Information Sciences and Systems, pages 663–667, 1984.

    Google Scholar 

  11. G. Holzmann. Automated protocol validation in ARGOS, assertion proving and scatter searching. IEEE trans. on Software Engineering, Vol 13, No 6, June 1987.

    Google Scholar 

  12. ISO 9074. Estelle: a Formal Description Technique based on an Extented State Transition Model. ISO TC97/SC21/WG6.1, 1989.

    Google Scholar 

  13. C. Jard and T. Jéron. On-line model-checking for finite linear temporal logic specifications. In Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, June 1989. Springer-Verlag, LNCS 407, pages 189–196.

    Google Scholar 

  14. R. Karp and R. Miller. Parallel program schemata. Journal of Comput. System Sci., 3(2):147–195, 1969.

    Google Scholar 

  15. T. Kasai and R. Miller. Homomorphisms between models of parallel computation. J.C.S.S, 25:285–331, 1982.

    Google Scholar 

  16. R. Keller. Vector replacement systems: a formalism for modeling asynchronous systems. Tech. Rep 117, Princeton Univ., 1972.

    Google Scholar 

  17. M. Lothaire. Combinatorics on Words. Volume 17, Gian-Carlo Rota, Encyclopedia of Mathematics and its Applications, 1983.

    Google Scholar 

  18. R. Martin and G. Memmi. Spécification et validation de systèmes temps réel à l'aide de réseaux de Petri à files. Technical Report 3, Revue Tech. Thomson-CSF, Sept. 1981.

    Google Scholar 

  19. J. Pachl. Reachability problems for CFSMs. Research Report CS-82-12, Univ. of Waterloo, Dept. of Comp. Sci., May 1982.

    Google Scholar 

  20. L. Rosier and H. Yen. Boundedness, empty channel detection, and synchronization for communicating finite automata. In T.C.S. 44, pages 69–105, 1986.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, Campus de Beaulieu, 35042, Rennes Cedex, France

    Thierry Jeron

Authors
  1. Thierry Jeron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jeron, T. (1991). Testing for unboundedness of Fifo channels. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020809

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

  • Online ISBN: 978-3-540-47002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics