The complexity of propositional linear temporal logics

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: A. P. Sistla Univ. of Massachusetts, Amherst
E. M. Clarke Carnegie-Mellon Univ., Pittsburgh, PA
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 32 Issue 3, July 1985
Pages 733-749
ACM New York, NY, USA
table of contents doi>10.1145/3828.3837
The complexity of propositional linear temporal logics Published by ACM 1985 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 85
· Downloads (cumulative): 1,327
· Citation Count: 236


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