scientific article; zbMATH DE number 512938

MaRDI QIDQ4281653zbMATH OpenFDO

Authors Paola Alimonti, E. Feuerstein

Publication date 10 March 1994

zbMATH Keywords

dynamic algorithmshypergaphsPetri nets

Mathematics Subject Classification ID

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

Recommendations

• Linear time analysis of properties of conflict-free and general Petri nets
• Priority conflict-free Petri nets
• Deciding a class of path formulas for conflict-free Petri nets
• scientific article; zbMATH DE number 3850481
• Normal and sinkless Petri nets

Cited in

(12)

• Priority conflict-free Petri nets
• Deciding a class of path formulas for conflict-free Petri nets
• Lower and upper bounds of shortest paths in reachability graphs
• Structure matrices for Petri nets and their applications
• scientific article; zbMATH DE number 3850481 (Why is no real title available?)
• scientific article; zbMATH DE number 3902049 (Why is no real title available?)
• scientific article; zbMATH DE number 3978396 (Why is no real title available?)
• Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view
• Non-oblivious local search for graph and hypergraph coloring problems
• Regular marked Petri nets
• Linear time analysis of properties of conflict-free and general Petri nets
• A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri 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 Q4281653)