"Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little ..."

Martin Lange (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-74407-8_7

access: closed

type: Conference or Workshop Paper

metadata version: 2018-01-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/concur/Lange07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/concur/Lange07
Martin Lange:
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. CONCUR 2007: 90-104

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.