dblp.uni-trier.dewww.uni-trier.de

Jacob Illum Rasmussen

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
10EEKim Guldstrand Larsen, Jacob Illum Rasmussen: Optimal reachability for multi-priced timed automata. Theor. Comput. Sci. 390(2-3): 197-213 (2008)
2007
9EEJan Jakob Jessen, Jacob Illum Rasmussen, Kim Guldstrand Larsen, Alexandre David: Guided Controller Synthesis for Climate Controller Using Uppaal Tiga. FORMATS 2007: 227-240
8EEJacob Illum Rasmussen, Gerd Behrmann, Kim Guldstrand Larsen: Complexity in Simplicity: Flexible Agent-Based State Space Exploration. TACAS 2007: 231-245
2006
7EEPatricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen: Almost Optimal Strategies in One Clock Priced Timed Games. FSTTCS 2006: 345-356
6EEJacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani: On using priced timed automata to achieve optimal scheduling. Formal Methods in System Design 29(1): 97-114 (2006)
2005
5EEGerd Behrmann, Kim Guldstrand Larsen, Jacob Illum Rasmussen: Beyond Liveness: Efficient Parameter Synthesis for Time Bounded Liveness. FORMATS 2005: 81-94
4EEKim Guldstrand Larsen, Jacob Illum Rasmussen: Optimal Conditional Reachability for Multi-priced Timed Automata. FoSSaCS 2005: 234-249
3EEGerd Behrmann, Kim Guldstrand Larsen, Jacob Illum Rasmussen: Optimal scheduling using priced timed automata. SIGMETRICS Performance Evaluation Review 32(4): 34-40 (2005)
2004
2EEGerd Behrmann, Kim Guldstrand Larsen, Jacob Illum Rasmussen: Priced Timed Automata: Algorithms and Applications. FMCO 2004: 162-182
1EEJacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani: Resource-Optimal Scheduling Using Priced Timed Automata. TACAS 2004: 220-235

Coauthor Index

1Gerd Behrmann [2] [3] [5] [8]
2Patricia Bouyer [7]
3Alexandre David [9]
4Jan Jakob Jessen [9]
5Kim Guldstrand Larsen [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]
6Nicolas Markey [7]
7K. Subramani [1] [6]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)