Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approach

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: E. A. Emerson Department of Computer Sciences, The University of Austin, Austin, TX
A. P. Sistla Electrical Engineering and Computer Science Department, The University of Illinois at Chicago, 851 South Morgan Street, Chicago, IL
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS) TOPLAS Homepage archive
Volume 19 Issue 4, July 1997
Pages 617 - 638
ACM New York, NY, USA
table of contents doi>10.1145/262004.262008
Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approach Published by ACM 1997 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 22
· Downloads (cumulative): 345
· Citation Count: 32


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