Referenced Items are not available for this document.
Consider a system of two communicating finite state machines that exchange messages over two unbounded, one-directional, FIFO channels. In our main result, we show that the boundedness problem is decidable for the class of such systems, where the two CFSMs are identical and constituted of only initial elementary circuits, and where the two CFSMs are linear. To analyse such systems, we introduce a reduction relation on the words. We then give examples to illustrate our purpose
Published in:
High Performance Distributed Computing, 1994., Proceedings of the Third IEEE International Symposium on
Date of Conference: 2-5 Aug 1994
- Page(s):
- 262 - 269
- Meeting Date :
- 02 Aug 1994-05 Aug 1994
- Print ISBN:
- 0-8186-6395-2
- INSPEC Accession Number:
- 4778656
- Conference Location :
- San Francisco, CA
- Digital Object Identifier :
- 10.1109/HPDC.1994.340236
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
