Toshimasa WATANABE


Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs
Satoshi TAOKA Daisuke TAKAFUJI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/06/01
Vol. E96-A  No. 6  pp. 1331-1339
Type of Manuscript:  Special Section PAPER (Special Section on Circuit, System, and Computer Technologies)
Category: 
Keyword: 
vertex coversminimum weight vertex cover problemapproximation algorithmscomputing experiment
 Summary | Full Text:PDF(1.5MB)

Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets
Satoru OCHIIWA Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/02/01
Vol. E96-A  No. 2  pp. 540-553
Type of Manuscript:  Special Section PAPER (Special Section on Mathematical Systems Science and its Applications)
Category: Algorithms and Data Structures
Keyword: 
timed Petri netslegal firing sequence problemsdeficient siphonsheuristic algorithmsperformance evaluation
 Summary | Full Text:PDF(893.4KB)

A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints
Tadachika OKI Satoshi TAOKA Toshiya MASHIMA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2012/03/01
Vol. E95-D  No. 3  pp. 769-777
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science – Mathematical Foundations and Applications of Computer Science and Algorithms –)
Category: 
Keyword: 
connectivity augmentation problemsedge-connectivitybipartition constraintsgraphspolynomial time algorithms
 Summary | Full Text:PDF(341.7KB)

The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms
Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2011/09/01
Vol. E94-A  No. 9  pp. 1833-1841
Type of Manuscript:  PAPER
Category: Concurrent Systems
Keyword: 
Petri netsmarking construction problemreachability problemheuristic algorithmscomputer experiments
 Summary | Full Text:PDF(359.2KB)

Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets
Toshimasa WATANABE Satoshi TAOKA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/11/01
Vol. E92-A  No. 11  pp. 2707-2716
Type of Manuscript:  Special Section PAPER (Special Section on Theory of Concurrent Systems and its Applications)
Category: INVITED
Keyword: 
Petri netsP-invariantsminimal supportssiphon-trapsFourier-Motzkin method
 Summary | Full Text:PDF(303.3KB)

Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets
Satoru OCHIIWA Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/11/01
Vol. E92-A  No. 11  pp. 2732-2744
Type of Manuscript:  Special Section PAPER (Special Section on Theory of Concurrent Systems and its Applications)
Category: 
Keyword: 
Petri netslegal firing sequence problemsdeficient siphonsheuristic algorithmsperformance evaluation
 Summary | Full Text:PDF(460.9KB)

Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem
Satoshi TAOKA Daisuke TAKAFUJI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2008/04/01
Vol. E91-A  No. 4  pp. 1140-1149
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
parallel branch-and-bound algorithmscombinatorial optimization problemsMPIoptimum solutions
 Summary | Full Text:PDF(361.8KB)

Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs
Daisuke TAKAFUJI Satoshi TAOKA Yasunori NISHIKAWA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2008/04/01
Vol. E91-A  No. 4  pp. 1129-1139
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
the maximum weight matching problem of graphsapproximate solutionsweight augmenting paths
 Summary | Full Text:PDF(490.7KB)

Performance Comparison of Algorithms for the Dynamic Shortest Path Problem
Satoshi TAOKA Daisuke TAKAFUJI Takashi IGUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2007/04/01
Vol. E90-A  No. 4  pp. 847-856
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
networksshortest pathsdynamic algorithmsstatic algorithmscomputational experiments
 Summary | Full Text:PDF(1.5MB)

Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs
Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/11/01
Vol. E89-A  No. 11  pp. 3216-3226
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent/Hybrid Systems: Theory and Applications)
Category: Concurrent Systems
Keyword: 
Petri netsinhibitor-arcslegal firing sequencespseudo-polynomial time algorithmsNP-hardness
 Summary | Full Text:PDF(447.3KB)

Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs
Satoshi TAOKA Kazuya WATANABE Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/04/01
Vol. E89-A  No. 4  pp. 1049-1057
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
graphspartitioning problemsheuristic algorithmsoptimal algorithmsdemandsupply
 Summary | Full Text:PDF(437.2KB)

On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree
Toshiya MASHIMA Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/04/01
Vol. E89-A  No. 4  pp. 1042-1048
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
graphsedge-connectivity of a specified set of verticesaugmentation problemsdegree constraintslinear time algorithms
 Summary | Full Text:PDF(325.4KB)

Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase
Toshiya MASHIMA Takanori FUKUOKA Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/02/01
Vol. E89-D  No. 2  pp. 751-762
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Graph Algorithm
Keyword: 
graphsvertex-connectivity of a specified set of verticesaugmentation problemsdegree constraintslinear time algorithms
 Summary | Full Text:PDF(624.1KB)

Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets
Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/11/01
Vol. E88-A  No. 11  pp. 3051-3061
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent/Hybrid Systems: Theory and Applications)
Category: 
Keyword: 
Petri netsminimal initial marking problemslegal firing sequence problemsdeficient siphonsheuristic algorithmsexperimental evaluation
 Summary | Full Text:PDF(394.9KB)

FOREWORD
Takao HINAMOTO Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/08/01
Vol. E88-D  No. 8  pp. 1861-1862
Type of Manuscript:  FOREWORD
Category: 
Keyword: 
 Summary | Full Text:PDF(77.7KB)

FOREWORD
Takao HINAMOTO Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/07/01
Vol. E88-D  No. 7  pp. 1321-1322
Type of Manuscript:  FOREWORD
Category: 
Keyword: 
 Summary | Full Text:PDF(77.7KB)

A 2-Approximation Algorithm to (k + 1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph
Toshiya MASHIMA Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Vol. E88-A  No. 5  pp. 1290-1300
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
graphsaugmentation problemsedge-connectivityapproximation algorithms
 Summary | Full Text:PDF(389.2KB)

Siphon-Trap-Based Algorithms for Efficiently Computing Petri Net Invariants
Akihiro TAGUCHI Atsushi IRIBOSHI Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/04/01
Vol. E88-A  No. 4  pp. 964-971
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
Petri netsP-invariantsminimal supportssiphon-trapsFourier-Motzkin method
 Summary | Full Text:PDF(224.9KB)

A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase
Takanori FUKUOKA Toshiya MASHIMA Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/04/01
Vol. E88-A  No. 4  pp. 954-963
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
graphsconnectivity augmentationvertex-connectivitydegree constraintslinear time algorithms
 Summary | Full Text:PDF(301.5KB)

A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph
Makoto TAMURA Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/04/01
Vol. E86-A  No. 4  pp. 822-828
Type of Manuscript:  Special Section PAPER (Special Section of Selected Papers from the 15th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
graphsaugmentation problemsvertex-connectivityperformance ratiospolynomial time algorithms
 Summary | Full Text:PDF(379.9KB)

Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants
Satoshi TAOKA Katsushi TAKANO Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/11/01
Vol. E85-A  No. 11  pp. 2436-2446
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent System Technology and Its Application to Multiple Agent Systems)
Category: 
Keyword: 
Petri netminimal siphon-trapsFourier-Motzkin methodinvariant computationpolynomial-time algorithms
 Summary | Full Text:PDF(494.1KB)

Experimental Evaluation of Two Algorithms for Computing Petri Net Invariants
Katsushi TAKANO Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/11/01
Vol. E84-A  No. 11  pp. 2871-2880
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent Systems Technology)
Category: 
Keyword: 
Petri netminimal siphon-trapsFourier-Motzkin methodmemory overflow
 Summary | Full Text:PDF(766.1KB)

Graph Augmentation Problems with Degree-Unchangeable Vertices
Toshiya MASHIMA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/03/01
Vol. E84-A  No. 3  pp. 781-793
Type of Manuscript:  Special Section PAPER (Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
graphconnectivity augmentationvertex-connectivitydegree-unchangeable verticespolynomial time algorithms
 Summary | Full Text:PDF(651KB)

A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets
Shin'ichiro NISHI Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/03/01
Vol. E84-A  No. 3  pp. 771-780
Type of Manuscript:  Special Section PAPER (Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
Petri netminimal initial markingslegal firing sequencesdeficient siphons
 Summary | Full Text:PDF(427.1KB)

The Legal Firing Sequence Problem of Petri Nets
Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D  No. 3  pp. 397-406
Type of Manuscript:  INVITED SURVEY PAPER
Category: Graph Algorithms
Keyword: 
Petri netslegal firing sequence problemstime complexity analysisNP-hardnesspseudo-polynomial time algorithms
 Summary | Full Text:PDF(684.7KB)

On the Legal Firing Sequence Problem of Petri Nets with Cactus Structure
Toshihiro FUJITO Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/03/25
Vol. E83-A  No. 3  pp. 480-486
Type of Manuscript:  Special Section PAPER (Special Section of Selected Papers from the 12th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
Petri netslegal firing sequence problempolynomial time algorithms
 Summary | Full Text:PDF(520.1KB)

Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net
Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1999/11/25
Vol. E82-A  No. 11  pp. 2566-2575
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent Systems Technology)
Category: 
Keyword: 
Petri netminimal siphonsbranch-and-bound algorithmssiphon extraction
 Summary | Full Text:PDF(427.8KB)

Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets
Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1999/11/25
Vol. E82-A  No. 11  pp. 2558-2565
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent Systems Technology)
Category: 
Keyword: 
Petri netminimal siphonspolynomial time solvabilityNP-completenessstrongly connectedness
 Summary | Full Text:PDF(588.9KB)

Finding a Minimal Siphon Containing Specified Places in a General Petri Net
Masahiro YAMAUCHI Shinji TANIMOTO Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/11/25
Vol. E79-A  No. 11  pp. 1825-1828
Type of Manuscript:  Special Section LETTER (Special Section on Description Models for Concurrent Systems and Their Applications)
Category: 
Keyword: 
general Petri netsminimal siphonspolynomial-time algorithmsstrongly connectedneddNP-completeness
 Summary | Full Text:PDF(336KB)

Finding Minimal Siphons in General Petri Nets
Shinji TANIMOTO Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/11/25
Vol. E79-A  No. 11  pp. 1817-1824
Type of Manuscript:  Special Section PAPER (Special Section on Description Models for Concurrent Systems and Their Applications)
Category: 
Keyword: 
general Petri netsminimal siphonspolynomial-time algorithmsstrongly connectednessNP-completeness
 Summary | Full Text:PDF(618.3KB)

FOREWORD
Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1994/10/25
Vol. E77-A  No. 10  pp. 1577-1578
Type of Manuscript:  FOREWORD
Category: 
Keyword: 
 Summary | Full Text:PDF(126.5KB)

FOREWORD
Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1994/04/25
Vol. E77-A  No. 4  pp. 593-594
Type of Manuscript:  FOREWORD
Category: 
Keyword: 
 Summary | Full Text:PDF(105.9KB)

A Linear Time Algorithm for Smallest Augmentation to 3-Edge-Connect a Graph
Toshimasa WATANABE Mitsuhiro YAMAKADO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/04/25
Vol. E76-A  No. 4  pp. 518-531
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
linear-time algorithms3-edge-connected graphsconnectivity augmentationcomputational complexity
 Summary | Full Text:PDF(1.1MB)

Qualitative Analysis of Periodic Schedules for Deterministically Timed Petri Net Systems
Kenji ONAGA Manuel SILVA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/04/25
Vol. E76-A  No. 4  pp. 580-592
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
periodic schedulePetri netslinear programmingtruncation
 Summary | Full Text:PDF(942KB)

Computing k-Edge-Connected Components of a Multigraph
Hiroshi NAGAMOCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/04/25
Vol. E76-A  No. 4  pp. 513-517
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design of algorithm, computational complexitymultigraphsedge-connectivityconnected componetsmaximum flowsminimum cutspolynomial-time algorithms
 Summary | Full Text:PDF(439.1KB)

Priority-List Scheduling in Timed Petri Nets
Takenobu TANIDA Toshimasa WATANABE Masahiro YAMAUCHI Kinji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/10/25
Vol. E75-A  No. 10  pp. 1394-1406
Type of Manuscript:  Special Section PAPER (Special Section on Application of Petri Nets to Concurrent System Design)
Category: 
Keyword: 
schedulingpriority-listsapproximation algorithmstimed Petri nets
 Summary | Full Text:PDF(989.1KB)

The Minimum Initial Marking Problem for Scheduling in Timed Petri Nets
Toshimasa WATANABE Takenobu TANIDA Masahiro YAMAUCHI Kenji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/10/25
Vol. E75-A  No. 10  pp. 1407-1421
Type of Manuscript:  Special Section PAPER (Special Section on Application of Petri Nets to Concurrent System Design)
Category: 
Keyword: 
timed Petri netsschedulingapproximation algorithmstime complexityNP-hardness
 Summary | Full Text:PDF(1.1MB)

Proof Procedures and Axiom Sets in Petri Net Models of Horn Clause Propositional Logic--Minimum Modification for Provability--
Toshimasa WATANABE Naomoto KATO Kenji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/04/25
Vol. E75-A  No. 4  pp. 478-491
Type of Manuscript:  Special Section PAPER (Special Issue on Discrete Mathematics and Its Application)
Category: 
Keyword: 
horn clausespropositional logicPetri netsvariable deletionclause addition
 Summary | Full Text:PDF(952.4KB)

Proof Procedures and Axiom Sets in Petri Net Models of Horn Clause Propositional Logic --Provability and Axiom Sets --
Toshimasa WATANABE Naomoto KATO Kenji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/03/25
Vol. E75-A  No. 3  pp. 425-435
Type of Manuscript:  Special Section PAPER (Special Section on the 4th Karuizawa Workshop on Circuits and Systems)
Category: 
Keyword: 
Horn clauses,propositional logicPetri netsproofsaxiom sets
 Summary | Full Text:PDF(678.2KB)

A Linear-Time Algorithm for Computing All 3-Edge-Connected Components of a Multigraph
Satoshi TAOKA Toshimasa WATANABE Kenji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/03/25
Vol. E75-A  No. 3  pp. 410-424
Type of Manuscript:  Special Section PAPER (Special Section on the 4th Karuizawa Workshop on Circuits and Systems)
Category: 
Keyword: 
linear-time algorithms3-edge-connected componentsdepth-first searchmultigraphs
 Summary | Full Text:PDF(978.8KB)

Analysis of Parallelism in Autonomous Execution of Data-Flow Program Nets
Qi-Wei GE Toshimasa WATANABE Kenji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1991/10/25
Vol. E74-A  No. 10  pp. 3008-3017
Type of Manuscript:  Special Section PAPER (Special Issue on JTC-CSCC '90)
Category: Graphs and Networks
Keyword: 
 Summary | Full Text:PDF(696.9KB)

Graph Augmentation Problems
Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1991/04/25
Vol. E74-A  No. 4  pp. 632-643
Type of Manuscript:  INVITED PAPER (Special Issue on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
 Summary | Full Text:PDF(864.3KB)

Topological Analysis of Firing Activities of Data-Flow Program Nets
Qi-Wei GE Toshimasa WATANABE Kenji ONAGA 
Publication:   IEICE TRANSACTIONS (1976-1990)
Publication Date: 1990/07/25
Vol. E73-E  No. 7  pp. 1215-1224
Type of Manuscript:  PAPER
Category: Software Theory
Keyword: 
 Summary | Full Text:PDF(873.9KB)

Minimum Initial Marking Problems of Petri Nets
Toshimasa WATANABE Yutaka MIZOBATA Kenji ONAGA 
Publication:   IEICE TRANSACTIONS (1976-1990)
Publication Date: 1989/12/25
Vol. E72-E  No. 12  pp. 1390-1399
Type of Manuscript:  Special Section PAPER (Special Issue on the 2nd Karuizawa Workshop on Circuits and Systems)
Category: Graphs and Networks
Keyword: 
 Summary | Full Text:PDF(758.6KB)

Time Complexity of Legal Firing Sequence and Related Problems of Petri Nets
Toshimasa WATANABE Yutaka MIZOBATA Kenji ONAGA 
Publication:   IEICE TRANSACTIONS (1976-1990)
Publication Date: 1989/12/25
Vol. E72-E  No. 12  pp. 1400-1409
Type of Manuscript:  Special Section PAPER (Special Issue on the 2nd Karuizawa Workshop on Circuits and Systems)
Category: Graphs and Networks
Keyword: 
 Summary | Full Text:PDF(853.6KB)

A Note on the Transformation Semigroups of Finite Automata
Toshimasa WATANABE Akira NAKAMURA 
Publication:   IEICE TRANSACTIONS (1976-1990)
Publication Date: 1981/02/25
Vol. E64-E  No. 2  pp. 88-89
Type of Manuscript:  LETTER
Category: Automata and Languages
Keyword: 
 Summary | Full Text:PDF(138.3KB)