International audienceIn this work, we present timed automata as a natural tool for posing and solving scheduling problems. We show how efficient shortest path algorithms for timed automata can find optimal schedules for the classical job-shop problem. We then extend these results to synthesize adaptive scheduling strategies for problems with uncertainty in task durations
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
AbstractIn classic scheduling theory, real-time tasks are usually assumed to be periodic, i.e. tasks...
In this paper, we show how the simple structure of the linear programs encountered during symbolic m...
International audienceIn this work, we present timed automata as a natural tool for posing and solvi...
In this work we present timed automata as a natural tool for posing and solving scheduling problems....
In this paper we develop a methodology for treating the problem of scheduling partially-ordered task...
This contribution reports on the considerable effort made recently towards extending and applying we...
In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased an...
In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased a...
This contribution reports on the considerable effort made recentlytowards extending and applying wel...
Schedule synthesis based on reachability analysis of timed automata has received attention in the la...
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
AbstractIn classic scheduling theory, real-time tasks are usually assumed to be periodic, i.e. tasks...
In this paper, we show how the simple structure of the linear programs encountered during symbolic m...
International audienceIn this work, we present timed automata as a natural tool for posing and solvi...
In this work we present timed automata as a natural tool for posing and solving scheduling problems....
In this paper we develop a methodology for treating the problem of scheduling partially-ordered task...
This contribution reports on the considerable effort made recently towards extending and applying we...
In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased an...
In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased a...
This contribution reports on the considerable effort made recentlytowards extending and applying wel...
Schedule synthesis based on reachability analysis of timed automata has received attention in the la...
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
International audienceWe present timing-constrained automata (TCA), a model for real-time computatio...
AbstractIn classic scheduling theory, real-time tasks are usually assumed to be periodic, i.e. tasks...
In this paper, we show how the simple structure of the linear programs encountered during symbolic m...
DOI
Add to ORKG