Mathematical programming approach to the Petri nets reachability problem
From MaRDI portal
Publication:856211
DOI10.1016/J.EJOR.2005.10.060zbMATH Open1102.90008OpenAlexW1996191241MaRDI QIDQ856211FDOQ856211
Saïd Hanafi, Thomas Bourdeaud'huy, Pascal Yim
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.060
Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Cellular automata (computational aspects) (68Q80)
Cites Work
- Parallel program schemata
- Formal verification of parallel programs
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- Modeling, reachability and controllability of bounded Petri nets based on semi-tensor product of matrices
- Title not available (Why is that?)
- Integer linear programming and the analysis of some Petri net problems
- Macro liveness graph and liveness of \(\omega\)-independent unbounded nets
- Petri net representation and reachability analysis of 0--1 integer linear programming problems
Uses Software
This page was built for publication: Mathematical programming approach to the Petri nets reachability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856211)
