Search the dblp DataBase
Kohkichi Tsuji: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Tadashi Matsumoto, Tetsuya Sakabe, Kohkichi Tsuji
On Parallel Symbolic Analysis of Large Networks and Systems. [Citation Graph (0, 0)][DBLP]
ISCAS, 1993, pp:1647-1650 [Conf] - Tadashi Matsumoto, Ken Saikusa, Kohkichi Tsuji
The minimum number of live minimal structural traps to make an arbitrary minimal structural deadlock lve in general Petri nets. [Citation Graph (0, 0)][DBLP]
ISCAS, 1993, pp:2717-2720 [Conf] - Atsushi Ohta, Kohkichi Tsuji
Insufficiently marked siphon of Petri nets - extension of token-free siphon. [Citation Graph (0, 0)][DBLP]
ISCAS (3), 2003, pp:244-247 [Conf] - Atsushi Ohta, Kohkichi Tsuji
Unfolding of Petri nets with semilinear reachability set. [Citation Graph (0, 0)][DBLP]
ISCAS (4), 2004, pp:501-504 [Conf] - Atsushi Ohta, Kohkichi Tsuji, Tomiji Hisamura
Minimal time reachability problem of some subclasses of timed Petri nets. [Citation Graph (0, 0)][DBLP]
ISCAS (1), 2005, pp:760-763 [Conf] - Kohkichi Tsuji, Tadao Murata
On reachability conditions for unrestricted Petri nets. [Citation Graph (0, 0)][DBLP]
ISCAS, 1993, pp:2713-2716 [Conf]
Search in 0.004secs, Finished in 0.004secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002