Enhancement Of Memory Capacity Of Neural Networks. - Daniel Y. Chao; David T. Wang (IROS, 1992)

X-Window Implementation of Finding Critical Loop, Next-Critical Loops and Iteration Bounds of Data Flow Graphs. - Daniel Y. Chao; David T. Wang (MASCOTS, 1993)

Minimum Marking for No Loop-Combination of General Petri Nets. - Daniel Y. Chao; David T. Wang (MASCOTS, 1993)

Convergence Time and Memory Capacity of Higher-order Hopfield Associative Memory with Multi-valued Neurons. - Daniel Y. Chao; David T. Wang; D. C. Douglas Hung (Comput. J., 1993)

Dependency Analysis - A Petri-Net-Based Technique for Synthesizing Large Concurrent Systems. - Yigang Chen 002; Wei-Tek Tsai; Daniel Y. Chao (IEEE Trans. Parallel Distributed Syst., 1993)

The Knitting Technique and Its Application to Communication Protocol Synthesis. - Daniel Y. Chao; David T. Wang (MASCOTS, 1994)

Extending the Knitting Technique to Petri Net Synthesis of Automated Manufacturing Systems. - Daniel Y. Chao; MengChu Zhou; David T. Wang (Comput. J., 1994)

A synthesis technique of general petri nets. - Daniel Y. Chao; David T. Wang (J. Syst. Integr., 1994)

An Interactive Tool for Design, Simulation, Verification, and Synthesis of Protocols. - Daniel Y. Chao; David T. Wang (Softw. Pract. Exp., 1994)

Performance of Multi-Rate Data Flow Graphs for Concurrent Processing. - Daniel Y. Chao (J. Inf. Sci. Eng., 1997)

Two theoretical and practical aspects of knitting technique: invariants and a new class of Petri net. - Daniel Y. Chao; David T. Wang (IEEE Trans. Syst. Man Cybern. Part B, 1997)

Extending knitting algorithm to synthesize resource sharing FMS. - Daniel Y. Chao (SMC, 1998)

Application of a Synthesis Algorithm to Flexible Manufacturing System. - Daniel Y. Chao (J. Inf. Sci. Eng., 1998)

Petri Net Synthesis and Synchronization Using Knitting Technique. - Daniel Y. Chao (J. Inf. Sci. Eng., 1999)

A Fast Implementation for Recurrent DSP Scheduling Using Final Matrix. - Daniel Y. Chao (J. Inf. Sci. Eng., 2000)

Properties and applications of synchronized choice Petri nets. - Daniel Y. Chao; Jose A. Nicdao (SMC, 2001)

Liveness for Synchronized Choice Petri Nets. - Daniel Y. Chao; Jose A. Nicdao (Comput. J., 2001)

Reachability of synchronized choice Petri nets. - Daniel Y. Chao (SMC, 2002)

Firing sequences of Synchronized Choice Nets. - Daniel Y. Chao (SMC, 2002)

Extended Synchronized Choice Nets. - Daniel Yuh Chao (Comput. J., 2003)

Reachability and Firing Sequences of Homogeneous Synchronized Choice Petri Nets. - Daniel Y. Chao (J. Inf. Sci. Eng., 2005)

Reachability of nonsynchronized choice Petri nets and its applications. - Daniel Y. Chao (IEEE Trans. Syst. Man Cybern. Part B, 2005)

Computation of Elementary Siphons in Petri Nets For Deadlock Control. - Daniel Yuh Chao (Comput. J., 2006)

Knitting Technique with TP-PT Generations for Petri Net Synthesis. - Daniel Yuh Chao (J. Inf. Sci. Eng., 2006)

An Incremental Approach to Extracting Minimal Bad Siphons. - Daniel Yuh Chao (J. Inf. Sci. Eng., 2007)

Virtual First-Order Structure. - Daniel Yuh Chao (J. Inf. Sci. Eng., 2007)

Searching Strick Minimal Siphons for SNC-Based Resource Allocation Systems. - Daniel Yuh Chao (J. Inf. Sci. Eng., 2007)

A Graphic-Algebraic Computation of Elementary Siphons of BS3PR. - Daniel Yuh Chao (J. Inf. Sci. Eng., 2007)

Correction to "Maximal Class of Weakly Live Ordinary Petri Nets Without Emptiable Siphons". - Daniel Y. Chao (IEEE Trans. Syst. Man Cybern. Part B, 2007)

Controllability for Siphons in S3PGR2. - Daniel Y. Chao (ETFA, 2009)

Unfolding of Multirate Data-Flow Graph to Compute Iteration Bound. - Daniel Yuh Chao (ICA3PP, 2009)

Deadlock Control for Weighted Systems of Simple Sequential Processes with Resources Requirement (WS3PR). - Daniel Yuh Chao (J. Inf. Sci. Eng., 2009)

Fewer Monitors and More Efficient Controllability for Deadlock Control in S3PGR2 (Systems of Simple Sequential Processes with General Resource Requirements). - Daniel Y. Chao (Comput. J., 2010)

Weighted Characteristic P-vector and Deadlock Control of WS3PR. - Daniel Yuh Chao (J. Inf. Sci. Eng., 2010)

A Necessary and Sufficient Condition for the Liveness of Normal Nets. - GuanJun Liu; Changjun Jiang; Daniel Y. Chao (Comput. J., 2011)

Enumeration of reachable and other states of simple version of Systems of Simple Sequential Processes with Resources (S3PR). - Daniel Yuh Chao; Hung-Yi Chen; Fang Yu 001 (ISIE, 2012)

Singular Formulas for Compound Siphons, Complementary Siphons and Characteristic Vectors for Deadlock Prevention in Cloud Computing. - GaiYun Liu; Daniel Yuh Chao; Yao-Nan Lien (SEKE, 2012)

A control policy for γ-nets without reachability analysis and siphon enumeration. - Wenhui Wu; Daniel Yuh Chao; Fang Yu 001 (CASE, 2013)

Enumeration of reachable (forbidden, live, and deadlock) states of top k-th order system (with a non-sharing resource place) of Petri nets. - Daniel Yuh Chao; Tsung Hsien Yu (IECON, 2013)

Structure Based Derived Uniform Formula for Siphon, Its Complementary Set and T-Characteristic Vectors. - Daniel Yuh Chao; Yen-Liang Pan; Wei-Hsiang Liao 004 (MIM, 2013)

A Best Method to Synthesize Very Large K-th Order Systems without Reachability Analysis (S). - Daniel Yuh Chao; Tsung Hsien Yu (SEKE, 2013)

Structure of weakly 2-dependent siphons. - Daniel Yuh Chao; Jiun-Ting Chen (Int. J. Control, 2013)

Controllability of control and mixture weakly dependent siphons in S3PR. - Liang Hong; Daniel Y. Chao (Int. J. Syst. Sci., 2013)

A merging method for the siphon-based FMS maximally permissive controllers with simpler structures. - Gai Yun Liu; Daniel Yuh Chao; Murat Uzam (IMA J. Math. Control. Inf., 2013)

Enumeration of reachable, forbidden, live states of gen-left k-net system (with a non-sharing resource place) of Petri Nets. - Daniel Yuh Chao; Tsung Hsien Yu (CICA, 2014)

Enumeration of reachable, forbidden, live, and deadlock states of bottom k-th order system (with a left side non-sharing resource place) of Petri nets. - Daniel Yuh Chao; Tsung Hsien Yu; Chia Chang Liou (ICNSC, 2014)

Closed form formula construction to enumerate control related states of K-th order S3PR system (with a Top Left side non-sharing resource place) of Petri nets. - Daniel Yuh Chao; Tsung Hsien Yu; Sou-Chein Wu (ICNSC, 2014)

Recursive solution of number of reachable states of a simple subclass of FMS. - Daniel Yuh Chao (Int. J. Syst. Sci., 2014)

Closed form formula construction to enumerate control related states of Bottom Left k-net S3PR system (with a Bottom Left side non-sharing resource place) of Petri nets. - Daniel Yuh Chao; Tsung Hsien Yu (ICNSC, 2015)

MLR: A new concept to launch a partial deadlock avoidance policy for k-th order system of Petri Nets. - Daniel Yuh Chao; Tsung Hsien Yu (IECON, 2015)

Improvement on 'structure of weakly 2-dependent siphons'. - Daniel Y. Chao (Int. J. Control, 2015)

Further reduction of minimal first-met bad markings for the computationally efficient synthesis of a maximally permissive controller. - GaiYun Liu; Daniel Yuh Chao (Int. J. Control, 2015)

On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems. - Daniel Yuh Chao (Int. J. Syst. Sci., 2015)

Enumeration of reachable (forbidden, live and deadlock) states of kth order system of Petri nets. - Daniel Yuh Chao (IMA J. Math. Control. Inf., 2015)

Uniform formulas for compound siphons, complementary siphons and characteristic vectors in deadlock prevention of flexible manufacturing systems. - Daniel Yuh Chao; Yen-Liang Pan (J. Intell. Manuf., 2015)

The fundamental closed-form solution of control-related states of kth order S3PR system with left-side non-sharing resource places of Petri nets. - Daniel Yuh Chao; Tsung Hsien Yu (Int. J. Control, 2016)

Extension of the lower bound of monitor solutions of maximally permissive supervisors to non-α net systems. - Wenhui Wu; Daniel Yuh Chao (Int. J. Syst. Sci., 2016)

Improvement on 'A merging method for the siphon-based flexible manufacturing systems maximally permissive controllers with simpler structures'. - Daniel Yuh Chao (IMA J. Math. Control. Inf., 2016)

Proof by model: a new knowledge-based reachability analysis methodology for Petri net. - Daniel Yuh Chao; Yen-Ping Chi; Tsung-Hsien Yu; Li-Chih Yu; Mike Y. J. Lee (IMA J. Math. Control. Inf., 2017)