CAV
2001
Springer
14 years 1 months ago
2001
Springer
CAV
2001
Springer
14 years 1 months ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
CAV
2001
Springer
14 years 1 months ago
2001
Springer
CAV
2001
Springer
14 years 1 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
CAV
2001
Springer
14 years 1 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
14 years 1 months ago
2001
Springer
CAV
2001
Springer
14 years 1 months ago
2001
Springer
CAV
2001
Springer
14 years 1 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...
IESS
2009
Springer
14 years 1 months ago
2009
Springer
IESS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Embedded systems are increasing in complexity, while several metrics such as time-to-market, reliability, safety and performance should be considered during the design of...