Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness

Martin Lange. Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. In Luís Caires, Vasco Thudichum Vasconcelos, editors, CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings. Volume 4703 of Lecture Notes in Computer Science, pages 90-104, Springer, 2007. [doi]

Abstract

Abstract is missing.