"Reducing the computational complexity of scheduling problems in Petri nets ..."

Juan Carlos Mugarza et al. (1998)

> Home

Details and statistics

DOI: 10.1109/ICSMC.1998.725377

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/smc/MugarzaCGTS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/smc/MugarzaCGTS98
Juan Carlos Mugarza, Hervé Camus, Jean-Claude Gentina, Enrique Teruel, Manuel Silva Suárez:
Reducing the computational complexity of scheduling problems in Petri nets by means of transformation rules. SMC 1998: 19-25

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.