Dong-Ik Lee

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Sadatoshi Kumagai

> Home > Persons > Dong-Ik Lee

Publications

1995
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/apn/LeeKK95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/apn/LeeKK95
Dong-Ik Lee, Sadatoshi Kumagai, Shinzo Kodama:
Handles and Reachability Analysis of Free Choice Nets. Application and Theory of Petri Nets 1995: 298-315
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/iscas/NakagawaLKK95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iscas/NakagawaLKK95
Masato Nakagawa, Dong-Ik Lee, Sadatoshi Kumagai, Shinzo Kodama:
Equivalent Net Abstraction and Firing Sequence Preservation. ISCAS 1995: 513-516
1993
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/isads/LeeKK93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isads/LeeKK93
Dong-Ik Lee, Sadatoshi Kumagai, Shinzo Kodama:
Synchronization mechanism of autonomous decentralized systems modelled by state machine decomposable nets. ISADS 1993: 255-261
[c1]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/iscas/LeeNKK93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iscas/LeeNKK93
Dong-Ik Lee, Tadaaki Nishimura, Sadatoshi Kumagai, Shinzo Kodama:
Polynomial order algorithms for structural and behavioral analysis of state machine allocatable nets. ISCAS 1993: 2709-2712

a service of

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.