Why Liveness for Timed Automata Is Hard, and What We Can Do About It.

Frédéric Herbreteau B. Srivathsan Thanh-Tung Tran Igor Walukiewicz

Published in: FSTTCS (2016)

Keyphrases

timed automata
model checking
reachability analysis
theorem prover
theorem proving
first order logic
real time systems
data sets
temporal logic
real time
databases
information retrieval
knowledge base
image processing
computationally hard