Characterizing stable and deriving valid inequalities of Petri nets

DOI10.3233/FI-2016-1374zbMATH Open1372.68189MaRDI QIDQ4976372FDOQ4976372

Authors: Marvin Triebel, Jan Sürmeli 

Publication date: 28 July 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Recommendations

• Characterizing stable inequalities of Petri nets
• Using linear programming in Petri net analysis
• Homogeneous equations of algebraic Petri nets
• Integer linear programming and the analysis of some Petri net problems
• Invariants of timed Petri nets

zbMATH Keywords

invariantstrapslinear inequalitiesstable propertiesinductive invariantsPetri net analysisco-traps

Mathematics Subject Classification ID

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

Cited In (4)

• A valuation-based analysis of conflict-free Petri nets
• Characterizing stable inequalities of Petri nets
• Verification of bounded Petri nets using integer programming
• Homogeneous equations of algebraic Petri nets

This page was built for publication: Characterizing stable and deriving valid inequalities of Petri nets

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