| * | 2008 |
|---|
| 44 | EE | Li Jiao,
Hejiao Huang,
To-Yat Cheung:
Handling Resource Sharing Problem Using Property-Preserving Place Fusions of Petri Nets.
Journal of Circuits, Systems, and Computers 17(3): 365-387 (2008) |
| 2007 |
|---|
| 43 | EE | Hejiao Huang,
To-Yat Cheung,
Xiao-Long Wang:
Applications of Property-Preserving Algebras to Component-Based Manufacturing System Design.
J. Inf. Sci. Eng. 23(1): 167-181 (2007) |
| 2006 |
|---|
| 42 | EE | Li Jiao,
To-Yat Cheung:
Compositional Verification for Workflow Nets.
Journal of Circuits, Systems, and Computers 15(4): 551-570 (2006) |
| 2005 |
|---|
| 41 | EE | Li Jiao,
To-Yat Cheung,
Weiming Lu:
Handling Synchronization Problem in Petri Net-Based System Design by Property-Preserving Transition-Reduction.
Comput. J. 48(6): 692-701 (2005) |
| 40 | EE | Li Jiao,
Hejiao Huang,
To-Yat Cheung:
Property-preserving Composition by Place Merging.
Journal of Circuits, Systems, and Computers 14(4): 793-812 (2005) |
| 39 | EE | H. J. Huang,
Li Jiao,
To-Yat Cheung:
Property-preserving subnet reductions for designing manufacturing systems with shared resources.
Theor. Comput. Sci. 332(1-3): 461-485 (2005) |
| 2004 |
|---|
| 38 | EE | Li Jiao,
To-Yat Cheung,
Weiming Lu:
On liveness and boundedness of asymmetric choice nets.
Theor. Comput. Sci. 311(1-3): 165-197 (2004) |
| 2003 |
|---|
| 37 | | H. J. Huang,
Li Jiao,
To-Yat Cheung:
Property-preserving composition of augmented marked graphs that share common resources.
ICRA 2003: 1446-1451 |
| 36 | EE | Fan Zhang,
To-Yat Cheung:
Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines.
IEEE Trans. Software Eng. 29(1): 1-14 (2003) |
| 35 | EE | Li Jiao,
To-Yat Cheung:
Characterizing Liveness Monotonicity for Weighted Petri Nets in Terms of Siphon-Based Properties.
Int. J. Found. Comput. Sci. 14(4): 641-658 (2003) |
| 2002 |
|---|
| 34 | EE | Li Jiao,
To-Yat Cheung,
Weiming Lu:
Characterizing Liveness of Petri Nets in Terms of Siphons.
ICATPN 2002: 203-216 |
| 33 | EE | Hai Zhuge,
Yanyan Li,
Jia Bi,
To-Yat Cheung:
KGCL: A Knowledge-Grid-Based Cooperative Learning Environment.
ICWL 2002: 192-202 |
| 2001 |
|---|
| 32 | EE | Yiqin Lu,
Gang Wei,
To-Yat Cheung:
Managing Feature Interactions in Telecommunications Systems by Temporal Colored Petri Nets.
ICECCS 2001: 260-269 |
| 31 | EE | Hai Zhuge,
To-Yat Cheung,
Hung-keng Pung:
A timed workflow process model.
Journal of Systems and Software 55(3): 231-243 (2001) |
| 2000 |
|---|
| 30 | | Z. Hai,
H. Pung,
To-Yat Cheung:
Timed Workflow: Concept, Model, and Method.
WISE 2000: 183-189 |
| 29 | EE | Huiwei Guan,
To-Yat Cheung:
Efficient approaches for constructing a massively parallel processing system.
Journal of Systems Architecture 46(13): 1185-1190 (2000) |
| 1999 |
|---|
| 28 | EE | To-Yat Cheung,
Yiqin Lu:
Five Classes of Invariant-Preserving Transformations on Colored Petri Nets.
ICATPN 1999: 384-403 |
| 27 | | Weijia Jia,
Jiannong Cao,
To-Yat Cheung,
Xiaohua Jia:
A Multicast Protocol Based on a Single Logical Ring Using a Virtual Token and Logical Clocks.
Comput. J. 42(3): 202-220 (1999) |
| 26 | | Moses Charikar,
Chandra Chekuri,
To-Yat Cheung,
Zuo Dai,
Ashish Goel,
Sudipto Guha,
Ming Li:
Approximation Algorithms for Directed Steiner Problems.
J. Algorithms 33(1): 73-91 (1999) |
| 1998 |
|---|
| 25 | | Moses Charikar,
Chandra Chekuri,
To-Yat Cheung,
Zuo Dai,
Ashish Goel,
Sudipto Guha,
Ming Li:
Approximation Algorithms for Directed Steiner Problems.
SODA 1998: 192-200 |
| 24 | | To-Yat Cheung,
Wei Zeng:
Invariant-preserving transformations for the verification of place/transition systems.
IEEE Transactions on Systems, Man, and Cybernetics, Part A 28(1): 114-121 (1998) |
| 1997 |
|---|
| 23 | EE | Huiwei Guan,
To-Yat Cheung,
Chi-Kwong Li,
Songnian Yu:
Parallel Design and Implementation of SOM Neural Computing Model in PVM Environment of a Distributed System.
APDC 1997: 26-33 |
| 22 | EE | Jiannong Cao,
Weijia Jia,
Xiaohua Jia,
To-Yat Cheung:
Design and Analysis of An Efficient Algorithm for Coordinated Checkpointing in Distributed Systems.
APDC 1997: 261-269 |
| 1996 |
|---|
| 21 | | Weijia Jia,
Jiannong Cao,
To-Yat Cheung:
A Multicast Protocol Based on a Single Logical Ring Using a Virtual Token and Logical Clocks.
ICPP, Vol. 1 1996: 85-92 |
| 20 | | Brian Siu,
To-Yat Cheung:
Towards a Method for Schema Translation from Relational to Object-Oriented Databases.
International Hong Kong Computer Society Database Workshop 1996: 307-323 |
| 19 | EE | To-Yat Cheung:
Petri nets for protocol engineering.
Computer Communications 19(14): 1250-1257 (1996) |
| 1995 |
|---|
| 18 | | To-Yat Cheung,
Xinming Ye:
A Fault-Detection Approach to the Conformance Testing of Nondeterministic Systems.
J. Parallel Distrib. Comput. 28(1): 94-100 (1995) |
| 1993 |
|---|
| 17 | | To-Yat Cheung:
An Integrated Software Environment for the Development of Distributed Systems.
Software Engineering Education 1993: 221-232 |
| 1991 |
|---|
| 16 | | To-Yat Cheung,
Youwen Wu,
Ye Xinming:
Generating Test Sequences and their Degrees of Indeterminism for Protocols.
PSTV 1991: 301-316 |
| 15 | | To-Yat Cheung,
Yun-zhou Zhu:
Recognizing Different Types of Beta-Cycles in a Database Scheme.
Theor. Comput. Sci. 81(2): 295-304 (1991) |
| 1990 |
|---|
| 14 | | To-Yat Cheung,
Yucheng Ye:
An Executor for Graphical LOTOS.
FORTE 1990: 547-550 |
| 1989 |
|---|
| 13 | | To-Yat Cheung,
Mike Sablatash:
A Functional Network Model for Analytical File Management in ISDN Systems from Generalization of Videotex Systems.
Computer Networks 16: 299-310 (1989) |
| 12 | | To-Yat Cheung:
An Algorithm with Decentralized Control for Sorting Files in a Network.
J. Parallel Distrib. Comput. 7(3): 464-481 (1989) |
| 1987 |
|---|
| 11 | | Yun-zhou Zhu,
To-Yat Cheung:
A New Distributed Breadth-First-Search Algorithm.
Inf. Process. Lett. 25(5): 329-334 (1987) |
| 1986 |
|---|
| 10 | | To-Yat Cheung:
On the Projection Method for Protocol Verification.
IEEE Trans. Software Eng. 12(11): 1088-1095 (1986) |
| 1983 |
|---|
| 9 | | To-Yat Cheung:
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation.
IEEE Trans. Software Eng. 9(4): 504-512 (1983) |
| 1982 |
|---|
| 8 | | To-Yat Cheung:
Estimating Block Accesses and Number of Recorde in File Management.
Commun. ACM 25(7): 484-487 (1982) |
| 7 | | To-Yat Cheung:
A Method for Equijoin Queries in Distributed Relational Databases.
IEEE Trans. Computers 31(8): 746-751 (1982) |
| 6 | | To-Yat Cheung:
A Statistical Model for Estimating the Number of Records in a Relational Database.
Inf. Process. Lett. 15(3): 115-118 (1982) |
| 1980 |
|---|
| 5 | EE | To-Yat Cheung:
Computational Comparison of Eight Methods for the Maximum Network Flow Problem.
ACM Trans. Math. Softw. 6(1): 1-16 (1980) |
| 4 | EE | To-Yat Cheung:
Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach.
ACM Trans. Math. Softw. 6(3): 387-390 (1980) |
| 3 | EE | To-Yat Cheung:
Algorithm 558: A Program for the Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach [H].
ACM Trans. Math. Softw. 6(3): 430-431 (1980) |
| 1974 |
|---|
| 2 | | To-Yat Cheung:
An Interactive Graphic Display for Region Partitioning by Linear Programming.
Commun. ACM 17(9): 513-516 (1974) |
| 1973 |
|---|
| 1 | | To-Yat Cheung:
Approximate Solutions and Error Bounds for Quasilinear Elliptic Boundary Value Problems.
J. Comput. Syst. Sci. 7(3): 306-322 (1973) |
