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
A complete axiomatisation for timed automata
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2000 (English)In: FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science, 2000, 277-289 p.Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
2000. 277-289 p.
Identifiers
URN: urn:nbn:se:uu:diva-36531OAI: oai:DiVA.org:uu-36531DiVA: diva2:64430
Available from: 2007-02-09 Created: 2007-02-09

Open Access in DiVA

No full text

Authority records BETA

Yi, Wang

Search in DiVA

By author/editor
Yi, Wang
By organisation
Department of Information TechnologyComputer Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 331 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