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
Petri nets and regular processes
Uppsala University.
Uppsala University.
Uppsala University.
1999 (English)In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, ISSN 0022-0000, Vol. 59, no 3, 476-503 p.Article in journal (Other scientific) Published
Abstract [en]

We consider the following problems: (a) Given a labelled Petri net and a finite automaton, are they equivalent?; (b) Given a labelled Petri net, is it equivalent to some (unspecified) finite automaton? These questions are studied within the framework of t

Place, publisher, year, edition, pages
ACADEMIC PRESS INC , 1999. Vol. 59, no 3, 476-503 p.
Identifiers
URN: urn:nbn:se:uu:diva-27308OAI: oai:DiVA.org:uu-27308DiVA: diva2:55203
Note
Addresses: Moller F, Tech Univ Ostrava, Dept Comp Sci, 17 Listopadu 15, CZ-70833 Ostrava, Czech Republic. Tech Univ Ostrava, Dept Comp Sci, CZ-70833 Ostrava, Czech Republic. Tech Univ Munich, Inst Informat, D-80290 Munich, Germany. Univ Uppsala, Dept CompAvailable from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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