Verifying time Petri nets by linear programming

DOI10.1007/BF02948851MaRDI QIDQ5934289zbMATH OpenOpenAlexFDO

Authors Xuandong Li

Publication date 19 June 2001

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02948851

zbMATH Keywords

linear programmingtime Petri netsverification problems

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 4209631
• A causal semantic for time Petri nets
• scientific article; zbMATH DE number 1390093
• The use of partial-order technique for verification of time Petri nets
• Verification of bounded Petri nets using integer programming

Cites work

• Minimum and maximum delay problems in real-time systems
• Recoverability of Communication Protocols--Implications of a Theoretical Study

Cited in

(9)

• Integer linear programming and the analysis of some Petri net problems
• scientific article; zbMATH DE number 6708300 (Why is no real title available?)
• Verification of Timed-Arc Petri Nets
• Timing constraint Petri nets and their schedulability analysis and verification
• Timing constraint Petri nets and their schedulability analysis and verification
• Modelling integer linear programs with petri nets
• A linear programming approach to general dataflow process network verification and dimensioning
• A method for parametric verification of the behavior of time Petri nets
• Verification of bounded Petri nets using integer programming

This page was built for publication: Verifying time Petri nets by linear programming

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