Login / Signup
Polynomial interrupt timed automata: Verification and expressiveness.
Béatrice Bérard
Serge Haddad
Claudine Picaronny
Mohab Safey El Din
Mathieu Sassolas
Published in:
Inf. Comput. (2021)
Keyphrases
</>
timed automata
model checking
temporal logic
reachability analysis
formal verification
verification method
expressive power
concurrent systems
formal methods
theorem prover
databases
formal analysis
low order
modal logic
asynchronous circuits
query language
artificial intelligence
data mining
neural network