Login / Signup
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:
ACM Trans. Comput. Log. (2020)
Keyphrases
</>
timed automata
model checking
reachability analysis
theorem proving
theorem prover
first order logic
hard problems
data sets
preprocessing
low cost
distributed systems
database
multi agent systems
temporal logic
embedded systems
clustering algorithm
neural network
real time systems
databases