Linearly priced timed automata for the bus schedule assignment problem.
Balázs DávidMáté HegyhátiMiklós KrészPublished in: GOL (2018)
Keyphrases
- timed automata
- model checking
- reachability analysis
- scheduling problem
- theorem prover
- high speed
- first order logic
- np hard
- theorem proving
- temporal logic
- scheduling algorithm
- single machine scheduling problem
- real time systems
- data sets
- bayesian networks
- events occur
- artificial intelligence
- processing times
- case study
- software engineering
- expert systems