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

DOI10.1007/3-540-61363-3_20MaRDI QIDQ4633174zbMATH OpenOpenAlexFDO

Authors 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

cluster graphexpressive powerminimal coveroutput placerank theorem

Mathematics Subject Classification ID

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

Recommendations

• On the regularity of Petri net languages
• scientific article; zbMATH DE number 3982527
• On liveness in extended non self-controlling nets
• A polynomial-time algorithm to decide liveness of bounded free choice nets
• Reachability in cyclic extended free-choice systems

Cites work

• Depth-First Search and Linear Graph Algorithms
• Free Choice Petri Nets
• scientific article; zbMATH DE number 4031000 (Why is no real title available?)
• scientific article; zbMATH DE number 47952 (Why is no real title available?)
• Reachability in cyclic extended free-choice systems

Cited in

(3)

• A polynomial-time algorithm to decide liveness of bounded free choice nets
• Inheritance of behavior
• Regular marked Petri nets

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

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