scientific article; zbMATH DE number 4024806

MaRDI QIDQ3766867zbMATH OpenFDO

Authors Matthias Jantzen

Publication date 1987

zbMATH Keywords

boundednesscomplete problemscomplexity classcomplexity of decision problemscoverabilitylivenesslower boundsPetri net languagereachabilityweak Petri net computer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1354143
• Complexity analysis of continuous Petri nets
• Complexity results for 1-safe nets
• scientific article; zbMATH DE number 4037227
• Complexity analysis of continuous Petri nets

Cited in

(12)

• Petri nets and large finite sets
• A unified approach for deciding the existence of certain petri net paths
• Some complexity results on transition systems and elementary net systems
• Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
• Petri nets with non-blocking arcs are difficult to analyze
• Forward analysis and model checking for trace bounded WSTS
• On selective unboundedness of VASS
• scientific article; zbMATH DE number 4106272 (Why is no real title available?)
• Unbounded product-form Petri nets
• Regular marked Petri nets
• Proving nonreachability by modulo-invariants
• Some behavioural aspects of net theory

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 Q3766867)