Modular implementation of concurrency

• Berthelot, G., Roucairol, G., and Valk, R. (1979). “Reductions of Nets and Parallel Programs,” inNet Theory and Applications, Bauer, W. (Ed.), Lecture Notes in Computer Science 84.

• Hack, M. (1973). “Analysis of Production Schemata by Petri-Nets.” MAC TR-94, Project MAC, MIT, Cambridge, Massachusetts.

  Google Scholar 

• Hack, M. (1975). “Petri Net Languages,” Comp. Structure Group Memo 124, Project MAC, Cambridge, Massachusetts.

• Hack, M. (1976). “The Equality Problem for Vector Addition Systems is Undecidable,”Theor. Comp. Sci.,2, 77–95.

  Google Scholar 

• Jensen, K. (1980). “A Method to Compare the Descriptive Power of Different Types of Petri Nets,” in MFCS 1980,Lecture Notes in Computer Science Vol. 88.

• Kasai, T. and Miller, R. (1979). “Homomorphism between Models of Parallel Computation,” IBM RC 7796 (#33742).

• Keller, R. (1974). “Towards a Theory of Universal Speed-Independent Modules.”IEEE Trans. Comput.,C-23, 1–33.

  Google Scholar 

• Keller, R. (1975). “A Fundamental Theorem of Asynchronous Parallel Computation,” inParallel Processing, Feng, T. Y., ed. Springer-Verlag, New York.

  Google Scholar 

• Kosaraju, S. (1973). “Limitation of Dijkstra's Semaphore Primitives and Petri Nets,” Tech. Rep. 25, Johns Hopkins Univ., Baltimore.

  Google Scholar 

• Kwong, Y. S. (1977). “On Reduction of Asynchronous Systems,”Theor. Comput. Sci.,5, 25–50.

  Google Scholar 

• Lipton, R. (1976). “The Reachability Problem Requires Exponential Space,” Research Report 62, Yale University.

• Patil, S. (1971). “Limitations and Capabilities of Dijkstra's Semaphore Primitives for Coordination among Processes,” Comp. Struc. Group Memo 57, MIT, Project MAC, Cambridge, Massachusetts.

  Google Scholar 

• Priese, L. (1980a). “On the Concept of Simulation in Asynchronous, Concurrent Systems,“ European Meeting on Cybernetics and Systems Research, Linz 1978; Proceedings inProgress in Cybernetics and Systems Research, Vol. II, Hemisphere, Washington, D.C.

• Priese, L. (1980b). “An Automatatheoretical Approach to Concurrency,” Research Report 12, Series B, Digital Syst. Lab., Helsinki Univ. of Technology.

• Rödding, D., and Rödding, W. (1979). “Networks of Finite Automata,” European Meeting on Cybernetics and Systems Research, Wien, 1976; inProgress in Cybernetics and Systems Research, Hemisphere.

Download references