Transition systems, infinitary languages and the semantics of uniform concurrency

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Transition systems, infinitary languages and the semantics of uniform concurrency

Full text

Pdf (728 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the seventeenth annual ACM symposium on Theory of computing table of contents

Providence, Rhode Island, United States

Pages: 252 - 262

Year of Publication: 1985

ISBN:0-89791-151-2

Authors

J W de Bakker	Centre for Mathematics and Computer Science & Free University of Amsterdam, Kruislaan 413, 1098 SJ Amsterdam
J J Meyer	Free University of Amsterdam, de Boelelaan 1081, 1081 HV Amsterdam
E R Olderog	Christian-Albrechts-Universität Institut für Informatik Olshausenstrasse 40 2300 Kiel 1
J I Zucker	State University of New York, Department of Computer Science, Ruffalo, New York

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 15, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/22145.22174 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	R. P. Act {1981), Recursive' Assertions and Parallel Programs, Act.a Inf. 15, pp. 219- 232.
	2	Krzysztof R. Apt, Formal Justification of a Proof System for Communicating Sequential Processes, Journal of the ACM (JACM), v.30 n.1, p.197-216, Jan. 1983 [doi>10.1145/322358.322372]
	3	J.W. de Bakker, J.A. Bergstra, J.W. Klop & J.-J.Ch. Meyer (1983), I,Jncar Time and Branching Time Semantics for Recursion with Merge, Theoretical Compt~t~r Science 34 (1984), pp. 135-156.
	4	J. W. de Bakker , J. I. Zucker, Denotational semantics of concurrency, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.153-158, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802188]
	5	J.W. de Bakker & J.L. Zucker (1982), Processes and the Denotational Semantics of Concurrency, Inform. and Control 54 (1/2), pp.70-120.
	6	J. W. de Bakker , Jeffery I. Zucker, Compactness in Semantics for Merge and Fair Merge, Proceedings of the Carnegie Mellon Workshop on Logic of Programs, p.18-33, June 06-08, 1983
	7	J.A. Bergstra & J.W. KloU (1984) , Process Algebra for Synchronouc Communication, Information arid Control 60 (1984) ,pp. 109-137.
	8	S. D. Brookes , C. A. R. Hoare , A. W. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM (JACM), v.31 n.3, p.560-599, July 1984 [doi>10.1145/828.833]
	9	M. Broy (1983), Fixed Point Th(,ory for Communication and Concurrency, in: D. Bj~rner (ed.), Proceeding.~ IFIP Working Conference on Formal Description of Proqramming Concepts II, North-Holland Amsterdam, pp.!25-}48
	10	J. Dugundji (1966), Topology, Allen and Bacon, Rockleigh, N.J.
	11	N Francez , D Lehmann , A Pnueli, A linear-history semantics for languages for distributed programming, Theoretical Computer Science, v.32 n.1-2, p.25-46, July 1984 [doi>10.1016/0304-3975(84)90022-7]
	12	William G. Golson , William C. Rounds, Connections between two theories of concurrency: metric spaces and synchronization trees, Information and Control, v.57 n.2-3, p.102-124, May/June 1983 [doi>10.1016/S0019-9958(83)80039-4]
	13	M. Helntess~ & G.D. Plotkin (1979), Full Abstraction for a Simple Parallel Programming Language, in: J.. Becvar (ed.), Proceedings 8th MI.'CS, LNCS 74, Springer, Ber l i n/New York, pp. 108-120.
	14	Robert M. Keller, Formal verification of parallel programs, Communications of the ACM, v.19 n.7, p.371-384, July 1976 [doi>10.1145/360248.360251]
	15	d.-J.Ch. Meyer (1984), Fixed Points and the Arbitrary and Fair Merge of a Fairly Simple Class of Processes, Techn. Reports IR-89/IR-92. Free University, Amsterdam.
	16	R. Milner, A Calculus of Communicating Systems, Springer-Verlag New York, Inc., Secaucus, NJ, 1982
	17	M. Nivat (1979), Infinite Words, Infinite Trees, Infinite Computations, in Proceedings Found. of ('omp. Sc. III.2, Mathematical Centre Tracts 109, Amsterdam, pp. 3- 52.
	18	Ernst-Rüdiger Olderog , C. A. R. Hoare, Specification-Oriented Semantics for Communicating Processes, Proceedings of the 10th Colloquium on Automata, Languages and Programming, p.561-572, July 18-22, 1983
	19	E.-R. Olderog & C.A.R. Hoare (1984), Specification-oriented Semantics for Communicating Processes, Techn. Monograph PRG-}7, Oxford Univ. Progr. Research Group.
	20	G.D. Plotkin (1983), An Operational Semantics for CSP in: D. Bj~rner (ed.), Formal Description of Programming Concepts II, North-Holland, Amsterdam, pp.199-223.
	21	W.C. Rounds ~ S.D. Brookes (1981), Possible Futures, Acceptances, Refusals, and Con~nunicating Processes, in Proceedings 22nd Symp. Found. of Comp. Sc., IEEE, pp. 140-149.

CITED BY 2

	J. C. M. Baeten , J. A. Bergstra , J. W. Klop, Decidability of bisimulation equivalence for process generating context-free languages, Journal of the ACM (JACM), v.40 n.3, p.653-682, July 1993
	Pierre America , Jaco de Bakker , Joost N. Kok , Jan J. M. M. Rutten, Operational semantics of a parallel object-oriented language, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.194-208, January 01, 1986, St. Petersburg Beach, Florida