Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights

DOI10.1137/120866427zbMath1286.68023OpenAlexW2087924522MaRDI QIDQ2840155

Ahmed Nazeem, Spyros A. Reveliotis

Publication date: 17 July 2013

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cdf1ad61ad52e21cccbf9a74a238132d1186767b

zbMATH Keywords

deadlock avoidancediscrete event systemsclassification theorypolyhedral theoryset-covering problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Online algorithms; streaming algorithms (68W27)

Related Items (1)

On the enforcement of a class of nonlinear constraints on Petri nets

This page was built for publication: Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights