scientific article; zbMATH DE number 3982527

MaRDI QIDQ3746895zbMATH OpenFDO

Authors A. D. Zakrevskij

Publication date 1985

zbMATH Keywords

deadlocksfree-choice Petri netslogical equationsternary matricestraps

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5079405
• scientific article; zbMATH DE number 1332966
• On liveness and controlled siphons in Petri nets
• Liveness for synchronized choice Petri nets
• Free Choice Petri Nets

Cited in

(15)

• Solving liveness problem for marked nets by exhaustive coverability trees
• A polynomial-time algorithm to decide liveness of bounded free choice nets
• Liveness characterization for GFC systems. I
• Observable liveness of Petri nets
• Liveness for synchronized choice Petri nets
• scientific article; zbMATH DE number 1696458 (Why is no real title available?)
• STP-based judgment method of reversibility and liveness of bounded Petri nets
• Deciding Structural Liveness of Petri Nets
• Finding a witness path for non-liveness in free-choice nets
• Detection of deadlocks and traps in Petri netsby means of Thelen's prime implicant method
• An \(O(|S|\times|T|)\)-algorithm to verify if a net is regular
• On liveness in extended non self-controlling nets
• Necessary and sufficient liveness condition of GS³PR Petri nets
• Liveness and boundedness analysis of Petri net synthesis
• Macro liveness graph and liveness of -independent unbounded nets

This page was built for publication:

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