Login / Signup
LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa.
Alessandro Artale
Luca Geatti
Nicola Gigante
Andrea Mazzullo
Angelo Montanari
Published in:
TIME (2023)
Keyphrases
</>
linear temporal logic
model checking
bounded model checking
temporal logic
deterministic automata
linear time temporal logic
finite automata
data sets
keywords
real world
information retrieval systems
neural network
learning algorithm
search algorithm
formal verification
syntactic categories