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
Decidability of Zenoness, Token Liveness, and Boundedness for Dense-Timed Petri Nets.
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. Datorteknik. (Algorithmic Program Verification)
Datorteknik. (Algorithmic Program Verification)
2004 (English)In: FSTTCS' 04: 24th Conference on Foundations of Software Technology and Theoretical Computer Science, 2004Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
2004.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-72675DOI: doi:10.1007/b104325ISBN: 3-540-24058-6 (print)OAI: oai:DiVA.org:uu-72675DiVA: diva2:100586
Available from: 2006-12-07 Created: 2006-12-07

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://user.it.uu.se/~parosh/publications/fsttcs05.ps
By organisation
Department of Information TechnologyComputer Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 567 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