"Time-Feasible Reachability Tree for Noncyclic Scheduling of Timed Petri Nets."

Hyun-Jung Kim, Jun-Ho Lee, Tae-Eog Lee (2015)

> Home

Details and statistics

DOI: 10.1109/TASE.2014.2313979

access: closed

type: Journal Article

metadata version: 2020-04-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tase/KimLL15a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tase/KimLL15a
Hyun-Jung Kim, Jun-Ho Lee, Tae-Eog Lee:
Time-Feasible Reachability Tree for Noncyclic Scheduling of Timed Petri Nets. IEEE Trans Autom. Sci. Eng. 12(3): 1007-1016 (2015)

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.