Computation tree logic (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Computation tree logic" in English language version.

refsWebsite

Global rank English rank

2^nd place

low place

274^th place

309^th place

11^th place

8^th place

dagstuhl.de

David, Amélie; Laroussinie, Francois; Markey, Nicolas (2016). Desharnais, Josée; Jagadeesan, Radha (eds.). "On the Expressiveness of QCTL". 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs). 59. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik: 28:1–28:15. doi:10.4230/LIPIcs.CONCUR.2016.28. ISBN 978-3-95977-017-0.
Hossain, Akash; Laroussinie, François (2019). Gamper, Johann; Pinchinat, Sophie; Sciavicco, Guido (eds.). "From Quantified CTL to QBF". 26th International Symposium on Temporal Representation and Reasoning (TIME 2019). Leibniz International Proceedings in Informatics (LIPIcs). 147. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik: 11:1–11:20. doi:10.4230/LIPIcs.TIME.2019.11. ISBN 978-3-95977-127-6. S2CID 195345645.

Vardi, Moshe Y. (2001). "Branching vs. Linear Time: Final Showdown" (PDF). Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science. 2031. Springer, Berlin: 1–22. doi:10.1007/3-540-45319-9_1.
David, Amélie; Laroussinie, Francois; Markey, Nicolas (2016). Desharnais, Josée; Jagadeesan, Radha (eds.). "On the Expressiveness of QCTL". 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs). 59. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik: 28:1–28:15. doi:10.4230/LIPIcs.CONCUR.2016.28. ISBN 978-3-95977-017-0.
Hossain, Akash; Laroussinie, François (2019). Gamper, Johann; Pinchinat, Sophie; Sciavicco, Guido (eds.). "From Quantified CTL to QBF". 26th International Symposium on Temporal Representation and Reasoning (TIME 2019). Leibniz International Proceedings in Informatics (LIPIcs). 147. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik: 11:1–11:20. doi:10.4230/LIPIcs.TIME.2019.11. ISBN 978-3-95977-127-6. S2CID 195345645.

Hossain, Akash; Laroussinie, François (2019). Gamper, Johann; Pinchinat, Sophie; Sciavicco, Guido (eds.). "From Quantified CTL to QBF". 26th International Symposium on Temporal Representation and Reasoning (TIME 2019). Leibniz International Proceedings in Informatics (LIPIcs). 147. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik: 11:1–11:20. doi:10.4230/LIPIcs.TIME.2019.11. ISBN 978-3-95977-127-6. S2CID 195345645.

Vardi, Moshe Y. (2001). "Branching vs. Linear Time: Final Showdown" (PDF). Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science. 2031. Springer, Berlin: 1–22. doi:10.1007/3-540-45319-9_1.