Normal Petri nets
type: Item
instance of: scholarly article
title: Normal Petri nets
zbMATH Open document ID: 0562.68047
DOI: 10.1016/0304-3975(84)90038-0
author: Hideki Yamasaki
published in: Theoretical Computer Science
publication date: 1984-01-01T00:00:00Z
review text: The author deals with the reachability problem for Petri nets. He defines normal Petri nets (in which the total number of tokens in an arbitrary minimal circuit does not decrease by firing transitions) and shows that their reachability sets are effectively computable semilinear sets.
reviewed by: Wlodzimierz Kwasowiec
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 3896314
zbMATH Keywords: reachability sets
MaRDI profile type: Publication
full work available at URL: 0304-3975(84)90038-0
OpenAlex ID: W2046665182
cites work: Decidable problems on the strong connectivity of Petri net reachability sets
cites work: Marked directed graphs
cites work: Semigroups, Presburger formulas, and languages
cites work: The decidability of persistence for vector addition systems
cites work: The equality problem for vector addition systems is undecidable
cites work: On the reachability problem for 5-dimensional vector addition systems
cites work: Properties of Conflict-Free and Persistent Petri Nets
cites work: Persistence of vector replacement systems is decidable
cites work: Q3891773
cites work: On weak persistency of Petri nets
description: scientific article; zbMATH DE number 3896314