Abstract
We try to develop a deeper understanding of “concurrent computations” by stating a precise and formalized conception of a realization of a concurrent computation. Within this formal apparatus we can present exact mathematical proofs for certain hierarchies of concurrent systems. As the following systems have a modular structure they might be helpful for a further theory of very fast hardware circuits without a global synchronizing clock.
Similar content being viewed by others
References
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.
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.
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.
Keller, R. (1975). “A Fundamental Theorem of Asynchronous Parallel Computation,” inParallel Processing, Feng, T. Y., ed. Springer-Verlag, New York.
Kosaraju, S. (1973). “Limitation of Dijkstra's Semaphore Primitives and Petri Nets,” Tech. Rep. 25, Johns Hopkins Univ., Baltimore.
Kwong, Y. S. (1977). “On Reduction of Asynchronous Systems,”Theor. Comput. Sci.,5, 25–50.
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.
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.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Priese, L. Modular implementation of concurrency. Int J Theor Phys 21, 993–1005 (1982). https://doi.org/10.1007/BF02084164
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02084164