Journal Publications:  ( see also DBLP  Bibliography Server)

  1. C. Lin, H. Kao, and H. Yen, Many-to-One Boundary Labeling, accepted for publication in Journal of Graph Algorithms and Applications, (special issue for APVIS 2007), 2008.

    　

  2. H. Yen, Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems,  International Journal of Foundations of Computer Science, Vol. 19, No. 49, 999-1013, 2008.

    　

  3. C. Lin and H. Yen, On Balloon Drawings of Rooted Trees, Journal of Graph Algorithms and Applications (pdf), (special issue for GD 2005), Vol. 11, No. 2, pp. 431-452, 2007.

    　

  4. T. Shih and H. Yen, Location-Aware Routing Protocol with Dynamic Adaptation of Request Zone for Mobile Ad Hoc Networks,  Wireless Networks,  14(3): 321-333,  2008.

    　

  5. O. Ibarra, and  H. Yen,  Deterministic Catalytic Systems Are not Universal,  Theoretical Computer Science (pdf) 363(2): 149-161,  2006.

    　

  6. O. Ibarra, S. Woodworth, H. Yen,  and Z. Dang, On the Computational Power of 1-Deterministic and Sequential P Systems, Fundamenta Informaticae (pdf), Vol. 73 (1-2), pp. 133-152, 2006.

    　

  7. H. Yen and L. Yu, Decidability Analysis of Self-Stabilization for Infinite State Systems, Fundamenta Informaticae, Vol. 70, No. 4, 387-402, 2006. (Postscript)

  8. O. Ibarra, H. Yen,  and Z. Dang, On Various Notions of Parallelism in P Systems, International Journal of Foundations of Computer Science, Vol. 16, No. 4, pp. 683-706,  August 2005. (Postscript)

    　

  9. D. Deng, and H. Yen, Quality-of-Service Provisioning System for Multimedia Transmission in IEEE 802.11 Wireless LANs,  IEEE Journal on Selected Areas in Communications (special issue on Mobile Computing and Networking), Vol. 23, No. 6, pp. 1240-1252, June 2005. (pdf)

    　

  10. F. Wang and H. Yen, Reachability Solution Characterization of Parametric Real-time Systems,  Theoretical Computer Science , Vol. 328 , pp. 187-201, 2004. (Postscript)

  11. C. Liao, H. Lu and H. Yen, Compact Floor-Planning via Orderly Spanning Trees, Journal of Algorithms, Vol. 48, No. 2, pp. 441-451, September 2003. (Postscript)

  12. K. Lin and H. Yen, An Omega-Automata Approach to the Representation of Bi-level Images, IEEE Trans. on Systems, Man, and Cybernetics (Part B: Cybernetics), Vol. 33, No. 3, pp. 524-531, June 2003. (Postscript)

  13. H. Yen, Sequential versus Concurrent Languages of Labeled Conflict-Free Petri Nets, IEEE Trans. on Automatic Control, Vol. 47, No. 7, pp. 1158-1162, July 2002. (Postscript)

  14. H. Yen, A Valuation-Based Analysis of Conflict-Free Petri Nets, Systems and Control Letters, Vo. 45, No. 5, pp. 387 - 395, 2002. (Postscript)

  15. T. Yeh, C. Kuo, C. Lei, and H. Yen, Distributed and On-line Routing on Tori, Algorithmica, Vol. 32, pp. 562-593, 2002. ( Postscript)

  16. K. Chin, and H. Yen, The Symmetry Number Problem for Trees, Information Processing Letters, Vol. 79, No. 2, pp. 73-79, May 2001. ( Postscript)

  17. H. Yen, Integer Linear Programming and the Analysis of Some Petri Net Problems, Theory of Computing Systems (formerly, Mathematical Systems Theory), Vol. 32, No. 4, pp. 467-485, 1999. ( Postscript)

  18. H. Yen, Priority Conflict-Free Petri Nets, Acta Informatica, Vol. 35, No. 8, pp. 673-688, 1998 ( Postscript )

  19. T. Yeh, C. Kuo, C. Lei, and H. Yen, Competitive Analysis of On-Line Disk Scheduling, Theory of Computing Systems (formerly, Mathematical Systems Theory), Vol. 31, No. 5, pp. 491-506, 1998. ( Postscript)

  20. H. Yen, B. Wang, and M. Yang, Deciding a Class of Path Formulas for Conflict-Free Petri Nets, Theory of Computing Systems (formerly, Mathematical Systems Theory) Vol. 30, No. 5, pp. 475-494, September/October 1997. ( Postscript)

  21. H. Yen, On Reachability Equivalence for BPP Nets, Theoretical Computer Science Vol. 179, No. 1-2, pp. 397-419, June 1997. ( Postscript)

  22. H. Yen, S. Jian, and T. Lao, Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes, Theoretical Computer Science, Vol. 170, No. 1-2, pp. 445-464, December 1996. ( Postscript)

  23. H. Yen, On the Regularity of Petri Net Languages, Information and Computation, Vol. 124, No. 2, pp. 168-181, 1996. ( Postscript)

  24. H. Yen, A Note on Fine Covers and Iterable Factors of VAS Languages, Information Processing Letters, Vol. 56, No. 5, pp. 237-243, December 1995. ( Postscript)

  25. H. Yen, B. Wang, and M. Yang, Some Complexity Results for Rings of Petri Nets, International Journal of Foundations of Computer Science, Vol. 5, Nos. 3 & 4, pp. 281-292, 1994. ( Postscript)

  26. H. Yen, On Multiterminal Single Bend Wirability, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, Vol. 13, No. 6, pp. 822-826, June 1994.

  27. H. Yen and N. Pak, Complexity Analysis of Propositional Concurrent Programs Using Domino Tiling, Mathematical Systems Theory, Vol. 26, pp. 357-378, 1993.

  28. R. Howell, L. Rosier, and H. Yen, Normal and Sinkless Petri Nets, Journal of Computer and System Sciences, Vol. 46, pp. 1-26, February 1993. ( Postscript)

  29. H. Yen, A Multiparameter Analysis of Domino Tiling with an Application to Concurrent Systems, Theoretical Computer Science, Vol. 98, pp. 263-287, 1992.

  30. H. Yen, A Unified Approach for Deciding the Existence of Certain Petri Net Paths, Information and Computation, Vol. 96, No. 1, pp. 119-137, 1992.

  31. H. Yen, Priority Systems with Many Identical Processes, Acta Informatica, Vol. 28, pp. 681-692, 1991.

  32. H. Yen, A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets, Information Processing Letters, Vol. 38, No. 2, pp. 71-76, 1991.

  33. R. Howell, L. Rosier and H. Yen, A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets, Theoretical Computer Science, Vol. 82, 1991, pp. 341-372.

  34. R. Howell, L. Rosier and H. Yen, Global and Local Views of State Fairness, Theoretical Computer Science, Vol. 80, No. 1, 1991, pp. 77-104.

  35. E. Gannett, S. Kothari and H. Yen, On Optimal Parallelization of Sorting Networks, Theoretical Computer Science, Vol. 76, No. 2-3, 1990, pp. 331-341.

  36. H. Yen, Communicating Processes, Scheduling and the Complexity of Nontermination, Mathematical Systems Theory, Vol. 23, No. 1, 1990, pp. 33-59.

  37. A. Sharma and H. Yen, Boundedness, Hierarchy of Fairness and Communication Networks with Delay, International Journal of Computer Mathematics, Vol. 26, 1989, pp. 161-178.

  38. L. Rosier and H. Yen, On the Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs, Theoretical Computer Science, Vol. 58, No. 1-3, 1988, pp. 263-324.

  39. L. Rosier and H. Yen, Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines, SIAM J. on Computing, Vol. 16, No. 5, 1987, pp. 779-807.

  40. R. Howell, L. Rosier and H. Yen, An O(n^1.5) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems, Information Processing Letters, Vol. 25, No. 1, 1987, pp. 27-33.

  41. R. Howell, D. Huynh, L. Rosier and H. Yen, Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States, Theoretical Computer Science, Vol. 46, No. 2,3, 1986, pp. 107-140.

  42. L. Rosier and H. Yen, Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata, Theoretical Computer Science, Vol. 44, No. 1, 1986, pp. 69-105.

  43. L. Rosier and H. Yen, A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems, Journal of Computer and System Sciences, Vol. 32, No. 1, 1986, pp. 105-135.

Book Chapters:

  1. H. Yen, `Introduction to Petri Net Theory,'  Chapter 14 in Recent Advances in Formal Languages and Applications, Z. Esik, C. Martin-Vide, V. Mitrana,  (Eds.),  Studies in Computational Intelligence 25, pp. 343-373, Springer,  2006 ( pdf ).

Conference Publications:

  1. H. Yen,  Concurrency, Synchronization, and Conflicts in Petri Nets (Invited Talk),   in Proc. of the 13th  International Conference on Implementation and Application of Automata (CIAA 2008), (LNCS 5148), pp. 33-35, San Francisco, USA, July 21-24, 2008.

    　

  2. C. Shen, P.  Lin, C. Lin, and H. Yen, Image Enhancement Using Piecewise Transfer Functions with Segmentations, in Proc. of the 2008 IEEE International Symposium on Consumer Electronics, (ISCE 2008), pp. 1-4,  Algarve, Portugal, April 14-16,  2008

    　

  3. C. Sung, M. Day, H. Yen, and W. Hsu, A Template Alignment Algorithm for Question Classification, in Proc. of the  2008 IEEE International Conference on Intelligence and Security Informatics, (ISI 2008), pp. 197-199, Taipei, Taiwan, June 17-20,  2008.

    　

  4. J. Fan, C. Lin, H. Lu, and H.Yen, Width-Optimal Visibility Representation of Plane Graphs, in Proc. of the 18th International Symposium on Algorithms and Computation (ISAAC 2007),  (LNCS 4835), pp. 160-171, Sendai, Japan, Dec. 17-19, 2007.

    　

  5. H. Yen, Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems, Workshop on  Reachability Problems,  (satellite event of the DLT'07), July 7-8, Turku, Finland.

    　

  6. H. Yen and C. Chen, Computing Minimal Elements of Upward-Closed Sets for Petri Nets, in Proc. of the 28th Int'l Conf. on Application and Theory of Petri Nets and Other Models of Concurrency,  (Petri Nets 2007),  (LNCS 4546), pp. 465-483, Siedlce, Poland, June 25-29, 2007.

    　

  7. Y. Yang, T. Chang, and H. Yen, A Unified Framework for Quantum Random Walk Algorithms on General Graphs, 7th IEEE Conf. on Nanotechnology, (IEEE-NANO 2007), pp. 1277-1282, Hong Kong, August 2-5,  2007.

    　

  8. C. Lin, and H.  Yen: Balloon Views of Source Code and Their Multiscalable Font Modes, in Proc. of the 11th Int'l Conference on Information Visualisation (IV 2007), pp.  53-58, Zurich, Switzerland, July 4-6, 2007.

    　

  9. H.  Kao, C.  Lin, and H.  Yen, Many-to-One Boundary Labeling,   in Proc. of the Asia-Pacific Symposium on Visualisation 2007 (APVIS 2007), pp. 65-72, Sydney, Australia, Feb. 5-7, 2007.

    　

  10. Y. Lee, C. Lin, and H. Yen, Mental Map Preserving Graph Drawing Using Simulated  Annealing,  in Proc. of the Asia Pacific Symposium on Information Visualisation 2006 (APVIS 2006), Tokyo, Japan, Feb. 1-3, 2006. (Postscript)

    　

  11. C. Lin, and H. Yen, On Balloon Drawings of Rooted Trees,  in Proc. of the 13th International Symposium on Graph Drawing (GD 2005), (LNCS 3843), Sept. 12-14, 2005, Limerick, Ireland. (Postscript)

    　

  12. O. Ibarra, S. Woodworth and H. Yen, Z. Dang, On Symport/Antiport Systems and Semilinear Sets, in Proc. of the  6th International Workshop on Membrane Computing (WMC6) ,  (LNCS 3850), July 18 - 21, 2005, Vienna, Austria.  (Postscript)

    　

  13. O.  Ibarra,  and  H. Yen. On Deterministic Catalytic Systems,   in Proc. of the 10th  International Conference on Implementation and Application of Automata (CIAA 2005), (LNCS 3845),  June 27–29, 2005, Sophia Antipolis, France. (Postscript)

    　

  14. O.  Ibarra, S. Woodworth, H. Yen and Z. Dang.    On Sequential and 1-Deterministic P Systems, in Proc. of  the 11th International  Computing and Combinatorics Conference (COCOON 2005), (LNCS 3595) , August 16 - 19, Kunming, Yunnan, China. (Postscript)

    　

  15. C.  Li, Z.  Dang, O.  Ibarra, and H.  Yen, Signaling P Systems and Verification Problems, in Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), (LNCS 3580), pp. 1462-1473,  July 11-15,  2005, Lisboa, Portugal.  (Postscript)
    　

  16. C. Lin and H. Yen, A new force-directed graph drawing method based on edge-edge repulsion, in Proc. of  the 9th International Conference on Information Visualisation (IV 2005),  July 6--8 ,  2005, London, UK. (pdf)
    　

  17. D. Deng and  H. Yen, Design and Performance Evaluation of an Optimal Collision Avoidance Mechanism over Congested and Noisy Channels for IEEE 802.11 DCF Access Method, in Proc. of International Conference on Information Networking 2005,  (ICOIN 2005) (LNCS 3391), pp. 11-20, Jan. 31- Feb. 2, 2005, Jeju Korea. (ps)
    　
  18. O. Ibarra, H. Yen, and Z. Dang, The power of maximal parallelism in P systems,  Eighth International Conference on Developments in Language Theory (DLT'04) (LNCS 3340), pp. 212-224,  Dec. 13-17, 2004, Auckland, New Zealand.

  19. H. Yen and L. Yu, Dependability Analysis of a Class of Probabilistic Petri Nets, in Proc. of 10th IEEE Pacific Rim Int'l Symp. on Dependable Computing, (PRDC 2004) pp. 373-382, March 3-5, 2004, Tahiti, French Polynesia. (ps)

  20. C. Chen, T. Lin, and H. Yen, Modelling and Analysis of Asynchronous Circuits and Timing Diagrams Using Parametric Timed Automata, in Proc. of the 23rd IASTED Int'l Conf. on Modelling, Identification and Control ( MIC 2004 ), February 23-25, 2004 Grindelwald, Switzerland (pdf)

  21. D. Deng, and H. Yen, Quality-of-Service Provisioning System for Multimedia Transmission in IEEE 802.11 Wireless LANs, in Proc. of the IASTED Int'l Conf. on Parallel and Distributed Computing and Networks ( PDCN 2004 ), February 17-19, 2004 Innsbruck, Austria. (pdf)

  22. J. Chuang, C. Lin, and H. Yen, Drawing Graphs with Non-Uniform Nodes Using Potential Fields, in Proc. of 11th International Symposium on Graph Drawing (GD 2003) (LNCS 2912) pp. 460-465, September 21-24, 2003, Perugia, Italy. (pdf)

  23. F. Wang and H. Yen, Timing Parameter Characterization of Real-Time Systems, in the Proceedings of the 8th International Conference on Implementation and Application of Automata ( CIAA 2003), (LNCS 2759) pp. 23-34, July 16-18, 2003, Santa Barbara, CA, USA. (ps)

  24. H. Yen, and L. Yu, Petri Nets with Simple Circuits, in the Proceedings of the Ninth International Computing and Combinatorics Conference, ( COCOON 2003) (LNCS 2697), pp. 149-158, July 25-28, 2003, Big Sky, MT, USA. (pdf)

  25. H. Chen, C. Liao, H. Lu and H. Yen, Some Applications of Orderly Spanning Trees in Graph Drawing, in the Proceedings of the 10th International Symposium on Graph Drawing (GD 2002) (LNCS 2528) pp. 332-343, August 26-28, 2002, Irvine, California. ( PostScript)

  26. M. Ho, and H. Yen, A Dictionary-based Compressed Pattern Matching Algorithm, in the Proceedings of the IEEE COMPSAC 2002, Oxford, England, August 26-29, 2002. ( pdf)

  27. M. Chuang, and H. Yen, On Nearly Symmetric Drawings of Graphs, in the Proceedings of the 6th International Conference on Information Visualisation, pp. 489-494, London, England, July 10-12, 2002. ( Postscript)

  28. C. Liao, H. Lu, and H. Yen, Floor-Planning via Orderly Spanning Tree, in the Proceedings of the 9th International Symposium on Graph Drawing 2001, (LNCS 2265) pp. 367-377, Vienna, Austria, Sept. 23-26, 2001. ( Postscript)

  29. F. Wang and H. Yen, Parametric Optimization of Open Real-Time Systems, in the Proceedings of the 8th International Static Analysis Symposium (SAS 2001), (LNCS 2126) pp. 299-318, La Sorbonne, Paris, 16-18 July 2001. ( Postscript)

  30. H. Yen, Analysis of Self-Stabilization for Infinite-State Systems, in the Proceedings of the 7th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2001), pp. 240-248, Skoevde, Sweden, June 11-13, 2001. ( Postscript)

  31. H. Chen, H. Lu and H. Yen, On Maximum Symmetric Subgraphs, in the Proceedings of the 8th International Symposium on Graph Drawing (GD 2000), (LNCS 1984), pp. 372-383, Colonial Williamsburg, Virginia, USA, September 20-23, 2000. ( Postscript)

  32. H. Yen, Fair Control of Omega-Automata, in the Proceedings of the 5th International Workshop on Discrete Event Systems (WODES 2000) (published in a book `Discrete Event Systems: Analysis and Control' by Kluwer Academic Publishers), pp. 355-362, Ghent, Belgium, August 21-23, 2000. ( Postscript)

  33. Y. Lin and H. Yen, An Omega-Automata Approach to the Compression of Bi-Level Images, in the Proceedings of CATS 2000 Computing: the Australasian Theory Symposium, Canberra, Australia, February 1-2, 2000. Electronic Notes in Theoretical Computer Science, Vol. 31, 2000.

  34. H. Chen, and H. Yen, Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations, in the Proceedings of the 7th International Symposium on Graph Drawing (GD 1999) (LNCS 1731), pp. 416-417, Stirin Castle, Czech, September 1999. ( Postscript)

  35. T. Yeh, C. Kuo, C. Lei, and H. Yen, Competitive Source Routing on Tori and Meshes, in the Proceedings of the 8th Annual International Symposium on Algorithms and Computation (ISAAC 1997) (LNCS 1350), pp. 82-91, Singapore, December 1997. ( Postscript)

  36. T. Yeh, C. Kuo, C. Lei, and H. Yen, Competitive Analysis of On-Line Disk Scheduling, in the Proceedings of the 7th Annual International Symposium on Algorithms and Computation (ISAAC 1996) (LNCS 1178), pp. 356-365, Osaka, Japan, December 1996. ( Postscript)

  37. H. Yen, S. Jian, and T. Lao, Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes, in the Proceedings of the 6th Annual International Symposium on Algorithms and Computation (ISAAC 1995) (LNCS 1004), pp. 301-310, Cairns, Australia, December 1995. ( Postscript)

  38. J. Chang, S. Chang, Z, Tsai, J. Wu, and H. Yen, Design, Implementation and Application of a B-ISDN Simulation Testbed, in the Proceedings of the 28th Annual Simulation Symposium, pp. 212-219, Phoenix, U.S.A., April 1995.

  39. H. Yen, B. Wang, and M. Yang, Some Complexity Results for Rings of Petri Nets, in the Proceedings of the 7th International Conference on Parallel and Distributed Computing Systems, pp. 354-357, Las Vegas, U.S.A., Oct. 1994

  40. H. Yen, On the Regularity of Petri Net Languages, in the Proceedings of the 1994 IEEE International Phoenix Conference on Computers and Communications, pp. 329-335, Phoenix, AZ, U.S.A., April 1994.

  41. H. Yen, B. Wang, and M. Yang, A Unified Approach for Reasoning about Conflict-Free Petri Nets, in the Proceedings of the 14th International Conference on Application and Theory of Petri Nets (Petri Nets 1993) (LNCS 691), pp. 513-531, Chicago, U.S.A., June, 1993.

  42. H. Yen and N. Pak, Complexity Analysis of Propositional Concurrent Programs Using Domino Tiling, in the Proceedings of the 26th Hawaii International Conference on System Sciences, pp. 253-262, Hawaii, U.S.A., January, 1993.

  43. H. Yen, Applications of Conflict-Free Petri Nets to Parallel Programs and Asynchronous Circuits, in the Proceedings of the 1992 IEEE International Phoenix Conference on Computers and Communications, pp. 766-773, Scottsdale, AZ, U.S.A., April 1992.

  44. N. Pak and H. Yen, Some Complexity Results for Problems Concerning Ada Programs, in the Proceedings of the 24th Annual Conference on Information Sciences and Systems, Princeton, NJ, March 1990.

  45. N. Pak and H. Yen, Priority Systems with Many Identical Processes, in the Proceedings of the 24th Annual Conference on Information Sciences and Systems, Princeton, NJ, March 1990.

  46. H. Yen, A Logic for Petri Nets and Its Applications, in the Proceedings of the Twenty-Seventh Annual Allerton Conference on Communication, Control, and Computing, pp. 714-723, Monticello, Illinois, September 1989.

  47. R. Howell, L. Rosier and H. Yen, Normal and Sinkless Petri Nets, in the Proceedings of the 7th International Conference on the Fundamentals of Computing Theory (FCT 1989) (LNCS 380), pp. 234-243, Szeged, Hungary, August 1989.

  48. H. Yen, Communicating Processes, Scheduling and the Complexity of Termination Problems, in the Proceedings of 1988 International Computer Symposium, pp. 46-51, Taiwan, Republic of China, December 1988.

  49. R. Howell, L. Rosier and H. Yen, A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets, in the Proceedings of the 13th Symposium on Mathematical Foundations of Computer Science (MFCS 1988) (LNCS 324), pp. 351-359, Carlsbad-Karlovy Vary, Czechoslovakia, August 1988.

  50. A. Sharma and H. Yen, Boundedness, Hierarchy of Fairness and Communication Networks with Delay, in the Proceedings of the 22nd Annual Conference on Information Sciences and Systems, pp. 445-449, Princeton, NJ, March 1988.

  51. E. Gannett, S. Kothari and H. Yen, On Optimal Parallelization of Sorting Networks, in the Proceedings of the 7th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS 1987) (LNCS 287), pp. 195-206, Pune, India, December 1987.

  52. L. Rosier and H. Yen, On Exact, Critical and Unique Versions of Some Graph Problems, in the Proceedings of the Twenty-fifth Annual Allerton Conference on Communication, Control, and Computing, pp. 1214-1223, Monticello, Illinois, September 1987.

  53. R. Howell, D. Huynh, L. Rosier and H. Yen, Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States, in the Proceedings of the Fourth Annual Symposium on Theoretical Aspects of Computer Science (STACS 1987) (LNCS 247), pp. 360-370, Passau, Federal Republic of Germany, February 1987.

  54. R. Howell, L. Rosier and H. Yen, On Global vs. Local State Fairness, in the Proceedings of the Twenty-Fourth Annual Allerton Conference on Communication, Control, and Computing, pp. 721-729, Monticello, Illinois, October 1986.

  55. L. Rosier and H. Yen, On the Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs, in the Proceedings of 13th International Colloquium on Automata, Languages and Programming (ICALP 1986) (LNCS 226), pp. 334-343, Rennes, France, July 1986.

  56. L. Rosier and H. Yen, Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines, in the Proceedings of the Third Annual Symposium on Theoretical Aspects of Computer Science (STACS 1986) (LNCS 210), pp. 306-320, Orsay, France, January 1986.

  57. M. Gouda, L. Rosier and H. Yen, A Theory of Closed Covers - To Decide Progress of Communicating Finite State Machines, in the Proceedings of the Twenty-Third Annual Allerton Conference on Communication, Control, and Computing, pp. 914-922, Monticello, Illinois, October 1985.

  58. L. Rosier and H. Yen, A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems, in the Proceedings of the Fifth International Conference on the Fundamentals of Computation Theory (FCT 1985) (LNCS 199), pp. 361-370, Cottbus, German Democratic Republic, September 1985.

  59. L. Rosier and H. Yen, Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines, in the Proceedings of the Second Annual Symposium on Theoretical Aspects of Computer Science (STACS 1985) (LNCS 182), pp. 287-298, Saarbrucken, West-Germany, January 1985.

  60. W. Tsai, B. Jeng, C. Chou, G. Char, P. Liu, C. Wang, and H. Yen, CTIPS -- A Multi-microprocessor system for Image Processing: Hardware Architecture, System Software, and Applications, in the Proceedings of 1983 International Symposium on VLSI Technology, Systems, and Applications, pp. 235-239, Taiwan, Republic of China, March 1983.

  61. W. Tsai, C. Wang and H. Yen, Moving Target Detection and Tracking on a Multi-microprocessor System for Image Processing, in the Proceedings of 1982 International Computer Symposium, pp. 292-298, Taiwan, Republic of China, December 1982.