default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacob Illum Rasmussen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2008
[j3]Kim Guldstrand Larsen
, Jacob Illum Rasmussen:
Optimal reachability for multi-priced timed automata. Theor. Comput. Sci. 390(2-3): 197-213 (2008)- 2006
- [j2]Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani:
On using priced timed automata to achieve optimal scheduling. Formal Methods Syst. Des. 29(1): 97-114 (2006) - 2005
- [j1]Gerd Behrmann, Kim Guldstrand Larsen, Jacob Illum Rasmussen:
Optimal scheduling using priced timed automata. SIGMETRICS Perform. Evaluation Rev. 32(4): 34-40 (2005)
Conference and Workshop Papers
- 2010
- [c10]Alexandre David, Jacob Deleuran Grunnet, Jan Jakob Jessen, Kim Guldstrand Larsen, Jacob Illum Rasmussen:
Application of Model-Checking Technology to Controller Synthesis. FMCO 2010: 336-351 - [c9]Marius Mikucionis, Kim Guldstrand Larsen, Jacob Illum Rasmussen, Brian Nielsen, Arne Skou, Steen Ulrik Palm, Jan Storbank Pedersen, Poul Hougaard:
Schedulability Analysis Using Uppaal: Herschel-Planck Case Study. ISoLA (2) 2010: 175-190 - 2009
- [c8]Ulrik H. Hjort, Jacob Illum Rasmussen, Kim Guldstrand Larsen, Michael A. Petersen, Arne Skou:
Model-Based GUI Testing Using Uppaal at Novo Nordisk. FM 2009: 814-818 - 2007
- [c7]Jan Jakob Jessen, Jacob Illum Rasmussen, Kim Guldstrand Larsen, Alexandre David:
Guided Controller Synthesis for Climate Controller Using Uppaal Tiga. FORMATS 2007: 227-240 - [c6]Jacob Illum Rasmussen, Gerd Behrmann, Kim Guldstrand Larsen:
Complexity in Simplicity: Flexible Agent-Based State Space Exploration. TACAS 2007: 231-245 - 2006
- [c5]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen:
Almost Optimal Strategies in One Clock Priced Timed Games. FSTTCS 2006: 345-356 - 2005
- [c4]Gerd Behrmann, Kim Guldstrand Larsen, Jacob Illum Rasmussen:
Beyond Liveness: Efficient Parameter Synthesis for Time Bounded Liveness. FORMATS 2005: 81-94 - [c3]Kim Guldstrand Larsen, Jacob Illum Rasmussen:
Optimal Conditional Reachability for Multi-priced Timed Automata. FoSSaCS 2005: 234-249 - 2004
- [c2]Gerd Behrmann, Kim Guldstrand Larsen, Jacob Illum Rasmussen:
Priced Timed Automata: Algorithms and Applications. FMCO 2004: 162-182 - [c1]Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani:
Resource-Optimal Scheduling Using Priced Timed Automata. TACAS 2004: 220-235
Parts in Books or Collections
- 2013
- [p1]Alexandre David, Gerd Behrmann, Peter E. Bulychev, Joakim Byg, Thomas Chatain, Kim G. Larsen, Paul Pettersson, Jacob Illum Rasmussen, Jirí Srba, Wang Yi, Kenneth Yrke Jørgensen, Didier Lime, Morgan Magnin, Olivier H. Roux, Louis-Marie Traonouez:
Tools for Model-Checking Timed Systems. Communicating Embedded Systems 2013: 165-225
Coauthor Index
aka: Kim Guldstrand Larsen
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
