uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. DEPARTMENT OCH COMPUTER SYSTEMS.
Show others and affiliations
2001 (English)In: 13th Conference on Computer Aided Verification, (CAV'01). 2001. LNCS 2102. Paris, France, July 18 to 23, 2001, 2001, 493-505 p.Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
2001. 493-505 p.
Identifiers
URN: urn:nbn:se:uu:diva-40642OAI: oai:DiVA.org:uu-40642DiVA: diva2:68543
Available from: 2008-10-17 Created: 2008-10-17

Open Access in DiVA

No full text

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 359 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf