8 search results - page 2 / 2 » Computing Optimal Coverability Costs in Priced Timed Petri N... |
FMSD
2008
13 years 5 months ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
PARELEC
2002
IEEE
13 years 10 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
NOSSDAV
2005
Springer
13 years 10 months ago
2005
Springer
Service overlay networks have recently attracted tremendous interests. In this paper, we propose a new integrated framework for specifying services composed of service components ...