Verification of bounded Petri nets using integer programming

DOI10.1007/S10703-006-0022-1MaRDI QIDQ878111zbMATH OpenOpenAlexFDO

Authors Victor Khomenko, Maciej Koutny

Publication date 26 April 2007

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10703-006-0022-1

zbMATH Keywords

Petri netsVerificationInteger programmingNet unfoldingsPartial order techniques

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1701773
• Verifying time Petri nets by linear programming
• Refining and verifying regular Petri nets
• Verification of concurrent programs using Petri net unfoldings
• Verification of siphons and traps for algebraic Petri nets
• Bounded parametric verification for distributed time Petri nets with discrete-time semantics
• Model Checking Bounded Prioritized Time Petri Nets
• Characterizing stable and deriving valid inequalities of Petri nets

Cites work

• scientific article; zbMATH DE number 1302046 (Why is no real title available?)
• scientific article; zbMATH DE number 1337888 (Why is no real title available?)
• scientific article; zbMATH DE number 1759626 (Why is no real title available?)
• scientific article; zbMATH DE number 1453070 (Why is no real title available?)
• An efficient incremental algorithm for solving systems of linear diophantine equations
• An improvement of McMillan's unfolding algorithm
• Avoiding slack variables in the solving of linear diophantine equations and inequations
• Branching processes of Petri nets
• Canonical prefixes of Petri net unfoldings
• Model checking using net unfoldings
• Operational and denotational semantics for the box algebra
• Verification of bounded Petri nets using integer programming

Cited in

(11)

• A practical approach to verification of mobile systems using net unfolding
• scientific article; zbMATH DE number 1701773 (Why is no real title available?)
• scientific article; zbMATH DE number 1759626 (Why is no real title available?)
• SAT-solving the coverability problem for Petri nets
• Occurrence nets then and now: the path to structured occurrence nets
• Verification of bounded Petri nets using integer programming
• Verifying time Petri nets by linear programming
• Integer linear programming and the analysis of some Petri net problems
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
• Verification of concurrent programs using Petri net unfoldings
• Failures: Their Definition, Modelling and Analysis

Describes a project that uses

Uses Software

• PEP
• Smodels
• CPLEX

This page was built for publication: Verification of bounded Petri nets using integer programming

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