CAV
2001
Springer
13 years 12 months ago
2001
Springer
In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a q...
CAV
2001
Springer
13 years 12 months ago
2001
Springer
CAV
2001
Springer
13 years 12 months ago
2001
Springer
CAV
2001
Springer
13 years 12 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...