Layered and Collecting NDFS with Subsumption for Parametric Timed Automata.

Hoang Gia Nguyen Laure Petrucci Jaco van de Pol

Published in: ICECCS (2018)

Keyphrases

timed automata
model checking
reachability analysis
description logics
theorem prover
first order logic
np complete
temporal logic
real time systems
data collection
theorem proving
parametric models
case study
database
decision trees
artificial intelligence
information retrieval