default search action
Daniel Yuh Chao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j38]Daniel Yuh Chao, Yen-Ping Chi, Tsung-Hsien Yu, Li-Chih Yu, Mike Y. J. Lee:
Proof by model: a new knowledge-based reachability analysis methodology for Petri net. IMA J. Math. Control. Inf. 34(4): 1277-1298 (2017) - 2016
- [j37]Daniel Yuh Chao, Tsung Hsien Yu:
The fundamental closed-form solution of control-related states of kth order S3PR system with left-side non-sharing resource places of Petri nets. Int. J. Control 89(1): 169-178 (2016) - [j36]Wenhui Wu, Daniel Yuh Chao:
Extension of the lower bound of monitor solutions of maximally permissive supervisors to non-α net systems. Int. J. Syst. Sci. 47(9): 2139-2151 (2016) - [j35]Daniel Yuh Chao:
Improvement on 'A merging method for the siphon-based flexible manufacturing systems maximally permissive controllers with simpler structures'. IMA J. Math. Control. Inf. 33(2): 163-171 (2016) - 2015
- [j34]Daniel Y. Chao:
Improvement on 'structure of weakly 2-dependent siphons'. Int. J. Control 88(1): 155-162 (2015) - [j33]GaiYun Liu
, Daniel Yuh Chao:
Further reduction of minimal first-met bad markings for the computationally efficient synthesis of a maximally permissive controller. Int. J. Control 88(8): 1423-1428 (2015) - [j32]Daniel Yuh Chao:
On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems. Int. J. Syst. Sci. 46(2): 332-339 (2015) - [j31]Daniel Yuh Chao:
Enumeration of reachable (forbidden, live and deadlock) states of kth order system of Petri nets. IMA J. Math. Control. Inf. 32(4): 823-837 (2015) - [j30]Daniel Yuh Chao, Yen-Liang Pan
Uniform formulas for compound siphons, complementary siphons and characteristic vectors in deadlock prevention of flexible manufacturing systems. J. Intell. Manuf. 26(1): 13-23 (2015) - [c22]Daniel Yuh Chao, Tsung Hsien Yu:
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. ICNSC 2015: 480-485 - [c21]Daniel Yuh Chao, Tsung Hsien Yu:
MLR: A new concept to launch a partial deadlock avoidance policy for k-th order system of Petri Nets. IECON 2015: 3148-3152 - 2014
- [j29]Daniel Yuh Chao:
Recursive solution of number of reachable states of a simple subclass of FMS. Int. J. Syst. Sci. 45(3): 702-710 (2014) - [c20]Daniel Yuh Chao, Tsung Hsien Yu:
Enumeration of reachable, forbidden, live states of gen-left k-net system (with a non-sharing resource place) of Petri Nets. CICA 2014: 141-147 - [c19]Daniel Yuh Chao, Tsung Hsien Yu, Sou-Chein Wu:
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. ICNSC 2014: 132-137 - [c18]Daniel Yuh Chao, Tsung Hsien Yu, Chia Chang Liou:
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. ICNSC 2014: 572-577 - 2013
- [j28]Daniel Yuh Chao, Jiun-Ting Chen:
Structure of weakly 2-dependent siphons. Int. J. Control 86(9): 1518-1533 (2013) - [j27]Liang Hong, Daniel Y. Chao:
Controllability of control and mixture weakly dependent siphons in S3PR. Int. J. Syst. Sci. 44(8): 1377-1385 (2013) - [j26]Gai Yun Liu
A merging method for the siphon-based FMS maximally permissive controllers with simpler structures. IMA J. Math. Control. Inf. 31(4): 551-573 (2013) - [c17]Wenhui Wu, Daniel Yuh Chao, Fang Yu:
A control policy for γ-nets without reachability analysis and siphon enumeration. CASE 2013: 1133-1138 - [c16]Daniel Yuh Chao, Tsung Hsien Yu:
Enumeration of reachable (forbidden, live, and deadlock) states of top k-th order system (with a non-sharing resource place) of Petri nets. IECON 2013: 3517-3523 - [c15]Daniel Yuh Chao, Yen-Liang Pan
Structure Based Derived Uniform Formula for Siphon, Its Complementary Set and T-Characteristic Vectors. MIM 2013: 301-306 - [c14]Daniel Yuh Chao, Tsung Hsien Yu:
A Best Method to Synthesize Very Large K-th Order Systems without Reachability Analysis (S). SEKE 2013: 417-420 - 2012
- [c13]Daniel Yuh Chao, Hung-Yi Chen, Fang Yu:
Enumeration of reachable and other states of simple version of Systems of Simple Sequential Processes with Resources (S3PR). ISIE 2012: 1369-1374 - [c12]GaiYun Liu, Daniel Yuh Chao, Yao-Nan Lien:
Singular Formulas for Compound Siphons, Complementary Siphons and Characteristic Vectors for Deadlock Prevention in Cloud Computing. SEKE 2012: 359-362 - 2011
- [j25]GuanJun Liu, Changjun Jiang, Daniel Y. Chao:
A Necessary and Sufficient Condition for the Liveness of Normal Nets. Comput. J. 54(1): 157-163 (2011) - 2010
- [j24]Daniel Y. Chao:
Fewer Monitors and More Efficient Controllability for Deadlock Control in S3PGR2 (Systems of Simple Sequential Processes with General Resource Requirements). Comput. J. 53(10): 1783-1798 (2010) - [j23]Daniel Yuh Chao:
Weighted Characteristic P-vector and Deadlock Control of WS3PR. J. Inf. Sci. Eng. 26(3): 1121-1136 (2010)
2000 – 2009
- 2009
- [j22]Daniel Yuh Chao:
Deadlock Control for Weighted Systems of Simple Sequential Processes with Resources Requirement (WS3PR). J. Inf. Sci. Eng. 25(6): 1963-1978 (2009) - [c11]Daniel Y. Chao:
Controllability for Siphons in S3PGR2. ETFA 2009: 1-7 - [c10]Daniel Yuh Chao:
Unfolding of Multirate Data-Flow Graph to Compute Iteration Bound. ICA3PP 2009: 460-465 - 2007
- [j21]Daniel Yuh Chao:
An Incremental Approach to Extracting Minimal Bad Siphons. J. Inf. Sci. Eng. 23(1): 203-214 (2007) - [j20]Daniel Yuh Chao:
Virtual First-Order Structure. J. Inf. Sci. Eng. 23(2): 371-385 (2007) - [j19]Daniel Yuh Chao:
Searching Strick Minimal Siphons for SNC-Based Resource Allocation Systems. J. Inf. Sci. Eng. 23(3): 855-869 (2007) - [j18]Daniel Yuh Chao:
A Graphic-Algebraic Computation of Elementary Siphons of BS3PR. J. Inf. Sci. Eng. 23(6): 1817-1831 (2007) - [j17]Daniel Y. Chao:
Correction to "Maximal Class of Weakly Live Ordinary Petri Nets Without Emptiable Siphons". IEEE Trans. Syst. Man Cybern. Part B 37(1): 248-249 (2007) - 2006
- [j16]Daniel Yuh Chao:
Computation of Elementary Siphons in Petri Nets For Deadlock Control. Comput. J. 49(4): 470-479 (2006) - [j15]Daniel Yuh Chao:
Knitting Technique with TP-PT Generations for Petri Net Synthesis. J. Inf. Sci. Eng. 22(4): 909-923 (2006) - 2005
- [j14]Daniel Y. Chao:
Reachability and Firing Sequences of Homogeneous Synchronized Choice Petri Nets. J. Inf. Sci. Eng. 21(1): 129-152 (2005) - [j13]Daniel Y. Chao:
Reachability of nonsynchronized choice Petri nets and its applications. IEEE Trans. Syst. Man Cybern. Part B 35(6): 1203-1213 (2005) - 2003
- [j12]Daniel Yuh Chao:
Extended Synchronized Choice Nets. Comput. J. 46(5): 505-523 (2003) - 2002
- [c9]Daniel Y. Chao:
Reachability of synchronized choice Petri nets. SMC 2002: 5 - [c8]Daniel Y. Chao:
Firing sequences of Synchronized Choice Nets. SMC 2002: 5 - 2001
- [j11]Daniel Y. Chao, Jose A. Nicdao:
Liveness for Synchronized Choice Petri Nets. Comput. J. 44(2): 124-136 (2001) - [c7]Daniel Y. Chao, Jose A. Nicdao:
Properties and applications of synchronized choice Petri nets. SMC 2001: 2742-2747 - 2000
- [j10]Daniel Y. Chao:
A Fast Implementation for Recurrent DSP Scheduling Using Final Matrix. J. Inf. Sci. Eng. 16(3): 391-422 (2000)
1990 – 1999
- 1999
- [j9]Daniel Y. Chao:
Petri Net Synthesis and Synchronization Using Knitting Technique. J. Inf. Sci. Eng. 15(4): 543-568 (1999) - 1998
- [j8]Daniel Y. Chao:
Application of a Synthesis Algorithm to Flexible Manufacturing System. J. Inf. Sci. Eng. 14(2): 409-447 (1998) - [c6]Daniel Y. Chao:
Extending knitting algorithm to synthesize resource sharing FMS. SMC 1998: 72-77 - 1997
- [j7]Daniel Y. Chao:
Performance of Multi-Rate Data Flow Graphs for Concurrent Processing. J. Inf. Sci. Eng. 13(1): 85-123 (1997) - [j6]Daniel Y. Chao, David T. Wang:
Two theoretical and practical aspects of knitting technique: invariants and a new class of Petri net. IEEE Trans. Syst. Man Cybern. Part B 27(6): 962-977 (1997) - 1994
- [j5]Daniel Y. Chao, MengChu Zhou, David T. Wang:
Extending the Knitting Technique to Petri Net Synthesis of Automated Manufacturing Systems. Comput. J. 37(1): 67-76 (1994) - [j4]Daniel Y. Chao, David T. Wang:
A synthesis technique of general petri nets. J. Syst. Integr. 4(1): 67-102 (1994) - [j3]Daniel Y. Chao, David T. Wang:
An Interactive Tool for Design, Simulation, Verification, and Synthesis of Protocols. Softw. Pract. Exp. 24(8): 747-783 (1994) - [c5]Daniel Y. Chao, David T. Wang:
The Knitting Technique and Its Application to Communication Protocol Synthesis. MASCOTS 1994: 234-238 - [c4]Daniel Y. Chao, David T. Wang:
An Interactive Tool for Design, Simulation, Verification, and Synthesis of Protocols. MASCOTS 1994: 381-385 - 1993
- [j2]Daniel Y. Chao, David T. Wang, D. C. Douglas Hung:
Convergence Time and Memory Capacity of Higher-order Hopfield Associative Memory with Multi-valued Neurons. Comput. J. 36(6): 554-561 (1993) - [j1]Yigang Chen, Wei-Tek Tsai, Daniel Y. Chao:
Dependency Analysis - A Petri-Net-Based Technique for Synthesizing Large Concurrent Systems. IEEE Trans. Parallel Distributed Syst. 4(4): 414-426 (1993) - [c3]Daniel Y. Chao, David T. Wang:
X-Window Implementation of Finding Critical Loop, Next-Critical Loops and Iteration Bounds of Data Flow Graphs. MASCOTS 1993: 107-112 - [c2]Daniel Y. Chao, David T. Wang:
Minimum Marking for No Loop-Combination of General Petri Nets. MASCOTS 1993: 265-270 - 1992
- [c1]Daniel Y. Chao, David T. Wang:
Enhancement Of Memory Capacity Of Neural Networks. IROS 1992: 519-526
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-18 18:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: