Proving liveness for networks of communicating finite state machines

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Mohammed G. Gouda Univ. of Texas at Austin, Austin
Chung-Kuo Chang Univ. of Texas at Austin, Austin
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series TOPLAS Homepage archive
Volume 8 Issue 1, Jan. 1986
Pages 154 - 180
ACM New York, NY, USA
table of contents doi>10.1145/5001.5002
Proving liveness for networks of communicating finite state machines Published by ACM 1986 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 413
· Citation Count: 17


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder