Author:
Krishnan Sriram C.,Puri Anuj,Brayton Robert K.
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. O. Carton. Chain Automata. In IFIP 13th World Computer Congress, pages 451–458, August 1994.
2. E. S. Chang, Z. Manna, and A. Pnueli. The Safety-Progress Classification. In F. L. Bauer, W. Bauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 143–202, 1993.
3. E. A. Emerson and C. L. Lei. Modalities for Model Checking: Branching Time Logic Strikes Back. Science of Computer Programming, 8(3):275–306, June 1987.
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
5. M. Kaminski. A Classification of ω-regular languages. Theoretical Computer Science, 36:217–229, 1985.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complexity Aspects of the Extension of Wagner's Hierarchy to k-Partitions;Electronic Proceedings in Theoretical Computer Science;2024-09-11
2. Classifying $$\omega $$-Regular Aperiodic k-Partitions;Descriptional Complexity of Formal Systems;2020
3. Approximate Automata for Omega-Regular Languages;Automated Technology for Verification and Analysis;2019
4. A Complexity Measure on Büchi Automata;Language and Automata Theory and Applications;2016
5. Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata;Automated Technology for Verification and Analysis;2014