"LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past ..."

Alessandro Artale et al. (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.TIME.2023.2

access: open

type: Conference or Workshop Paper

metadata version: 2023-09-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/time/ArtaleGGMM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/time/ArtaleGGMM23
Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, Angelo Montanari:
LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa. TIME 2023: 2:1-2:14

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.