| Reference: | [AD091] G. Adomi and A. Poggi, "Actions representation in a 4-D space, "
[nt.J.Man- A1achine Studies, vol. 35, 1991, pp.825-841.
[AGH90] G. Agha, "Concurrent object-oriented programming, "Communication
of the ACM, vol. 33, no. 9, Sep.1990, pp.125-141.
[BR093] H.1. Broersma, R. 1. Faudree, J. van den Heuvel and H. 1. Veldman,
"Decomposition of bipartite graphs under degree constraints, "
Networks, vol. 23,1993, pp.159-164.
[COU91] G. F. Coulouris and J. Dollimore, Distributed Systems Concepts and
Design Addition-Wesley, 1991.
[GEH84] N. H. Gehani and T. A. Cargill, "Concurrent programming in the Ada
language: The polling bias, "Software-Practice and Experience,
vol. 14, no. 5, May 1984, pp.413-427.
[HER91] L. Herault and J-J Niez, "Neural network and combinatorial
optimization: a study of N-P complete graph problems, "Neura!
Network: Advance and Applications, E. Gelenbe, Ed. North-Holland:
Elsevier Science Publishers B. V., 1991, pp.165-213.
[HOG89] R. V. Hogg and E. A. Tanis, Probability and Statistical Inference.
Macmillan Publishing Company, 1989.
[KER70] B. W. Kernighan and S. Lin, "An efficient heuristic procedure for
partitioning graphs, "Be!! Syst. Technic.I. vol. :,),9, Feb. 1970,
pp.291-307.
[KlM92] J-U Kim. C-H Lee, and M. Kim , "Efficient multiple-way networkpartitioning
algorithm, "Computer-Aided Design. vol. 25, no. 5,
May 1992, pp.269-280.
[KLE85] L. Kleinrock, "Distributed systems, "Communication of the ACM,
vol. 28, no. 11, Nov. 1985, pp.1200-1212.
[MEY93] B. Meyer, "Systematic concurrent object-oriented programming,"
Communication of the AC1Vl, vol. 36, no. 9, Sep. 1993, pp.56-80.
[MUR86] T. Murata, N. Komoda, K. Matsumoto, and K. Haruna, "A Petri Netbased controller for flexible and maintainable sequence control and its
applications in factory automation, "IEEE Transactions on IndustriaL
ELectronics, vol. IE-33,no. 1, Feb. 1986, pp.I-8.
[MUR89] T. Murata, "Petri Nets: Properties, analysis and applications, "
Proceedings of the IEEE, vol. 77, no. , Apr. 1989, pp.541-5S0.
[P AP82] C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization
Algorithm and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[PAP92] Y. E. Papelis and T. L. Casavant, "Specification and analysis of parallel/distributed software and systems by Petri Nets with transition enabling
functions, "IEEE Transactions on Software Engineering, vol. IS,
no. 3, March 1992, pp.252-261.
[PETS 1] 1. L. Peterson, Petri-Net Theory and the Modeling of Systems.
Englewood Cliffs, N.J.: Prentice-Hall, July 1981.
[TA093] L. Tao and Y. Zhao, "Multi-way graph partition by stochastic
probe, "Computers Ops Res., vol. 20, no. 3,1993, pp.321-347.
[TOR85] A. A. Torn, "Simulation nets, a simulation modeling nnd validntion tool,"Simulation, Aug. 1985, pp.70-74.
[ZH092] M. C. Zhou, F. DeCesme, A. A. Desrochers, "A hybrid methodology for synthesis of Petri Net models for manufacturing systems, "IEEE
Transitions on Robotics and Auwmacion. vol. S, no. 3, June 1992.pp.350-360. |
