"Solving the Petri Nets Reachability Problem Using the Logical Abstraction ..."

Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-24664-0_8

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cpaior/BourdeaudhuyHY04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpaior/BourdeaudhuyHY04
Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim:
Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. CPAIOR 2004: 112-126

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.