Login / Signup
Deriving Unbounded Reachability Proof of Linear Hybrid Automata during Bounded Checking Procedure.
Dingbao Xie
Wen Xiong
Lei Bu
Xuandong Li
Published in:
IEEE Trans. Computers (2017)
Keyphrases
</>
hybrid automata
finite state automata
integer arithmetic
theorem proving
hidden markov models
database
training data
query processing
state space
upper bound