On structural conditions for weak persistency and semilinearity of Petri nets

DOI10.1016/0304-3975(92)90329-EzbMath0745.68081MaRDI QIDQ1186602

Kunihiko Hiraishi, Atsunobu Ichikawa

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Petri netssemilinearity of the reachability setweak persistency

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

On the teaching complexity of linear sets ⋮ Reduced state space representation for unbounded vector state spaces ⋮ Learning semilinear sets from examples and via queries ⋮ On conditions for the liveness of weakly persistent nets ⋮ PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS

Cites Work

• Normal Petri nets
• On weak persistency of Petri nets
• Properties of Conflict-Free and Persistent Petri Nets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On structural conditions for weak persistency and semilinearity of Petri nets