Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Lecture Notes in Computer Science;M. Arfi,1987
2. Arfi, M.: Opérations polynomiales et hiérarchies de concaténation. Theor. Comput. Sci. 91(1), 71–84 (1991)
3. Clarke, E.M., Draghicescu, I.A.: Expressibility results for linear-time and branching-time logics. In: REX Workshop, pp. 428–437 (1988)
4. Lecture Notes in Computer Science;E.M. Clarke,1982
5. Kamp, J.A.: Tense Logic and the Theory of Linear Order. PhD thesis, Univ. of California, Los Angeles (1968)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Branching-time logics and fairness, revisited;Mathematical Structures in Computer Science;2021-10
2. PARTIALLY ORDERED AUTOMATA AND PIECEWISE TESTABILITY;LOG METH COMPUT SCI;2021
3. Automaton-Based Criteria for Membership in CTL;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09
4. A Fragment of Linear Temporal Logic for Universal Very Weak Automata;Automated Technology for Verification and Analysis;2018
5. Quantifier Alternation for Infinite Words;Lecture Notes in Computer Science;2016