Mathematical programming approach to the Petri nets reachability problem

DOI10.1016/j.ejor.2005.10.060zbMath1102.90008OpenAlexW1996191241MaRDI QIDQ856211

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

zbMATH Keywords

Petri netsreachability problem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Cellular automata (computational aspects) (68Q80)

Related Items (2)

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

• INA

Cites Work

• Parallel program schemata
• Formal verification of parallel programs
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mathematical programming approach to the Petri nets reachability problem