Verification of bounded Petri nets using integer programming
type: Item
instance of: scholarly article
title: Verification of bounded Petri nets using integer programming
zbMATH Open document ID: 1112.68104
author: Victor Khomenko
author: Maciej Koutny
published in: Formal Methods in System Design
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 5146150
zbMATH Keywords: Verification
zbMATH Keywords: Petri nets
zbMATH Keywords: Integer programming
zbMATH Keywords: Net unfoldings
zbMATH Keywords: Partial order techniques
describes a project that uses: PEP
describes a project that uses: CPLEX
describes a project that uses: Smodels
MaRDI profile type: Publication
full work available at URL: s10703-006-0022-1
OpenAlex ID: W2041613450
cites work: Avoiding slack variables in the solving of linear diophantine equations and inequations
cites work: An efficient incremental algorithm for solving systems of linear diophantine equations
cites work: Branching processes of Petri nets
cites work: An improvement of McMillan's unfolding algorithm
cites work: Model checking using net unfoldings
cites work: Q4264234
cites work: Canonical prefixes of Petri net unfoldings
cites work: Q4536617
cites work: Operational and denotational semantics for the box algebra
cites work: Q4247289
cites work: Q4955343
DOI: 10.1007/S10703-006-0022-1
Recommended article: Q2769606
Recommended article: Verifying time Petri nets by linear programming
Recommended article: Refining and verifying regular Petri nets
Recommended article: Verification of concurrent programs using Petri net unfoldings
Recommended article: Verification of siphons and traps for algebraic Petri nets
Recommended article: Q3081898
Recommended article: Model Checking Bounded Prioritized Time Petri Nets
Recommended article: Characterizing Stable and Deriving Valid Inequalities of Petri Nets
description: scientific article; zbMATH DE number 5146150