Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Automatic verification of real-time communicating systems by constraint-solving
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Symbolic Controller Synthesis for Discrete and Timed Systems
Hybrid Systems II
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Hi-index | 0.00 |
The main scope of this paper is the implementation of a method for production scheduling, using advanced model checking tools. This method makes use of timed automata to model complex production scheduling problems such as the job-shop and the open-shop scheduling problems. By modelling scheduling problems using timed automata, feasible schedules correspond to paths in the automata, while finding the optimum schedule corresponds to finding the shortest path in an automaton. Several algorithms and heuristics have been proposed for finding the shortest paths in timed automata, which are mainly based on the implementation of graph algorithms that search the transition graph. In our work, an advanced model design and checking tool, called UPPAAL, has been used to implement and test the above method on a number of different models and to show the effectiveness of such an approach in terms of finding optimal or near to optimal, schedules in polynomial time, even for large-scale problems.