Theoretical Computer Science
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Job-Shop Scheduling Using Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Scheduling a Steel Plant with Timed Automata
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Task Graph Scheduling Using Timed Automata
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Synthesis and Stochastic Assessment of Schedules for Lacquer Production
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Discount-Optimal Infinite Runs in Priced Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-Based GUI Testing Using Uppaal at Novo Nordisk
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Complexity in simplicity: flexible agent-based state space exploration
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Solving production scheduling with earliness/tardiness penalties by constraint programming
Journal of Intelligent Manufacturing
Verification, performance analysis and controller synthesis for real-time systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Orchestrating stream graphs using model checking
ACM Transactions on Architecture and Code Optimization (TACO)
| Hi-index | 0.00 |
Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness of timed automata allows - unlike many classical approaches - the modelling of scheduling problems of very different kinds. Furthermore, the models are robust against changes in the parameter setting and against changes in the problem specification. This paper presents a case study that was provided by Axxom, an industrial partner of the AMETIST project. It consists of a scheduling problem for lacquer production, and is treated with the timedautomata approach. A number of problems have to be addressed for the modelling task: the information transfer from the industrial partner, the derivation of timed automaton model for the case study, and the heuristics that have to be added in order to reduce the search space. We try to isolate the generic problems of modelling for model checking, and suggest solutions that are also applicable for other scheduling cases. Model checking experimentsand solutions are discussed.