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]

@inproceedings{Lange07,
  title = {Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness},
  author = {Martin Lange},
  year = {2007},
  doi = {10.1007/978-3-540-74407-8_7},
  url = {http://dx.doi.org/10.1007/978-3-540-74407-8_7},
  tags = {logic},
  researchr = {https://researchr.org/publication/Lange07},
  cites = {0},
  citedby = {0},
  pages = {90-104},
  booktitle = {CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings},
  editor = {Luís Caires and Vasco Thudichum Vasconcelos},
  volume = {4703},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-74406-1},
}