Using linear programming in Petri net analysis

DOI10.1051/ro/1989230100431zbMath0672.90106OpenAlexW2511213573MaRDI QIDQ3826378

Philippe Mahey, Jean-Bernard Lasserre

Publication date: 1989

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104952

zbMATH Keywords

Petri netslinear system of inequalitiesalgebraic representation of polyhedral sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Linear inequalities of matrices (15A39) Polytopes and polyhedra (52Bxx)

This page was built for publication: Using linear programming in Petri net analysis