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
On Yen's path logic for Petri nets
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2011 (English)In: International Journal of Foundations of Computer Science, ISSN 0129-0541, Vol. 22, no 4, 783-799 p.Article in journal (Refereed) Published
Place, publisher, year, edition, pages
2011. Vol. 22, no 4, 783-799 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-159159DOI: 10.1142/S0129054111008428OAI: oai:DiVA.org:uu-159159DiVA: diva2:442933
Projects
UPMARCautomated verification of highly concurrent algorithmsPetri nets
Available from: 2011-09-22 Created: 2011-09-22 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Atig, Mohamed Faouzi

Search in DiVA

By author/editor
Atig, Mohamed Faouzi
By organisation
Computer Systems
In the same journal
International Journal of Foundations of Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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