On Global Scheduling Independency in Networks of Timed Automata.
Sergio Feo ArenisMilan VujinovicBernd WestphalPublished in: FORMATS (2017)
Keyphrases
- timed automata
- model checking
- scheduling problem
- reachability analysis
- scheduling algorithm
- social networks
- dynamic scheduling
- round robin
- theorem prover
- data sets
- network design
- network model
- network analysis
- real time
- complex networks
- resource allocation
- complex systems
- community detection
- np hard
- parallel machines
- heterogeneous networks
- artificial intelligence
- response time