Searching for "Minimum-Cost Reachability for Priced Timed Automata." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Minimum-Cost Reachability for Priced Timed Automata
by Gerd Behrmann, A. Fehnker, T.S. Hune, K. G. Larsen, P. Pettersson, J. M. T. Romijn, F.W. Vaandrager, F. W. Va, Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Larsen, Paul Pettersson, Judi Romijn — 2000 — In Proceedings of HSCC’01, Lect. Notes Comput. Sci
…Minimum-Cost Reachability for Priced Timed Automata G. Behrmann, A. Fehnker, T.S. Hune, K.G. Larsen…
Cited by 18 (5 self) – Add To MetaCart

Data Structures and Algorithms for the Analysis of Real Time Systems
by Gerd Behrmann, Gerd Behrmann, Phd Dissertation — 2003
… . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99 Paper D: Minimum-Cost Reachability for Priced Timed Automata 101 1 Introduction…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB