Revisiting reachability in Polynomial Interrupt Timed Automata.

Béatrice Bérard Serge Haddad

Published in: Inf. Process. Lett. (2022)

Keyphrases

timed automata
model checking
reachability analysis
theorem prover
theorem proving
first order logic
state space
transitive closure
real time systems
temporal logic
low order
inference rules
data mining
query language
web services
information systems
machine learning