An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular

DOI10.1007/3-540-61363-3_20zbMath1418.68150OpenAlexW1606774004MaRDI QIDQ4633174

Andrei Kovalyov

Publication date: 2 May 2019

Published in: Application and Theory of Petri Nets 1996 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61363-3_20

zbMATH Keywords

expressive powerminimal coverrank theoremcluster graphoutput place

Mathematics Subject Classification ID

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

Related Items (1)

Inheritance of behavior

Cites Work

• Reachability in cyclic extended free-choice systems
• Free Choice Petri Nets
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular