Login / Signup
An Asymptotically Correct Finite Path Semantics for LTL.
Andreas Morgenstern
Manuel Gesell
Klaus Schneider
Published in:
LPAR (2012)
Keyphrases
</>
linear temporal logic
model checking
formal semantics
sample size
temporal logic
logic programming
shortest path
complete axiomatization
neural network
conceptual model
inference rules
finite automata
modal operators
proof theory
bounded model checking
deterministic automata