Integer linear programming and the analysis of some Petri net problems
type: Item
instance of: scholarly article
title: Integer linear programming and the analysis of some Petri net problems
zbMATH Open document ID: 0934.68065
author: K. Appert
published in: Theory of Computing Systems
publication date: 1999-06-28T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1309896
zbMATH Keywords: Petri nets
MaRDI profile type: Publication
full work available at URL: s002240000127
OpenAlex ID: W2084957010
DOI: 10.1007/S002240000127
Recommended article: Modelling integer linear programs with petri nets
Recommended article: Petri net representation and reachability analysis of 0--1 integer linear programming problems
Recommended article: Using linear programming in Petri net analysis
Recommended article: Q4782070
Recommended article: Mathematical programming approach to the Petri nets reachability problem
Recommended article: On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
Recommended article: Verification of bounded Petri nets using integer programming
Recommended article: Q4215822
Recommended article: Q4247289
Recommended article: Verifying time Petri nets by linear programming
description: scientific article; zbMATH DE number 1309896