Author:
Friedmann Oliver,Latte Markus,Lange Martin
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Emerson, E., Jutla, C.: Tree automata, μ-calculus and determinacy. In: Proc. 32nd Symp. on Foundations of Computer Science, San Juan, pp. 368–377. IEEE, Los Alamitos (1991)
2. Formal Models and Semantics;E.A. Emerson,1990
3. Emerson, E.A., Halpern, J.Y.: “Sometimes” and “not never” revisited: On branching versus linear time temporal logic. J. of the ACM 33(1), 151–178 (1986)
4. Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs. SIAM Journal on Computing 29(1), 132–158 (2000)
5. Emerson, E.A., Sistla, A.P.: Deciding full branching time logic. Information and Control 61(3), 175–201 (1984)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+;Theoretical Computer Science;2020-04
2. Sublogics of a branching time logic of robustness;Information and Computation;2019-06
3. A Parallel Linear Temporal Logic Tableau;Electronic Proceedings in Theoretical Computer Science;2017-09-06
4. Rewrite rules for CTL*;Journal of Applied Logic;2017-05
5. To be fair, use bundles;Annals of Mathematics and Artificial Intelligence;2017-04-19