Difference Bound Constraint Abstraction for Timed Automata Reachability Checking.

Weifeng Wang Li Jiao

Published in: FORTE (2015)

Keyphrases

regret bounds
timed automata
lower bound
model checking
upper bound
reachability analysis
theorem prover
real time systems
theorem proving
constraint networks
high level
first order logic
state space
information systems
global constraints
transitive closure
reinforcement learning