Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata.
Raymond R. DevillersHanna KlaudelPublished in: FORMATS (2016)
Keyphrases
- timed automata
- model checking
- reachability analysis
- theorem prover
- network analysis
- social networks
- high level
- network structure
- network model
- network size
- fuzzy rule bases
- data sets
- decision theoretic planning
- heterogeneous networks
- routing problem
- computer networks
- complex networks
- first order logic
- machine learning