Remarks on the Reachability Graphs of Petri Nets

DOI10.18255/1818-1015-2022-4-366-371MaRDI QIDQ6081671zbMATH OpenOpenAlexFDO

Authors Yu. Belov

Publication date 5 October 2023

Published in Modeling and Analysis of Information Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://mathnet.ru/eng/mais785

zbMATH Keywords

graph isomorphismnetwork coverage graphnetwork reachability graphPetri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• Petri nets. Fundamental models, verification and applications.
• Recent advances in formal languages and applications.

Cited in

(8)

• scientific article; zbMATH DE number 3919829 (Why is no real title available?)
• scientific article; zbMATH DE number 1232238 (Why is no real title available?)
• scientific article; zbMATH DE number 762060 (Why is no real title available?)
• Analyzing Reachability for Some Petri Nets With Fast Growing Markings
• On the reachability and reversibility problems in a class of Petri nets
• scientific article; zbMATH DE number 5201373 (Why is no real title available?)
• Some Remarks on Definability of Process Graphs
• On the Petri net realization of context-free graphs

This page was built for publication: Remarks on the Reachability Graphs of Petri Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081671)