Modeling concurrency with geometry

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Modeling concurrency with geometry

Full text

Pdf (1.45 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Orlando, Florida, United States

Pages: 311 - 322

Year of Publication: 1991

ISBN:0-89791-419-8

Author

Vaughn Pratt

Computer Science Department, Stanford University, Stanford, CA

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 33, Citation Count: 20

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/99583.99625 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.

	Bir35	G. Birkhoff. On the combination of subalgebras. Proc. Cambridge Phil. Soc, 29:441- 464, 1935.
	BK89	Jan A. Bergstra , Jan Willem Klop, Process theory based on bisimulation semantics, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, p.50-122, May 30-June 03, 1988
	Bro88	1~. Brown. Topology: A geomelric account of general topology, homotopy lypes and lhe fundamental groupoid. Halsted Press, New York, t988.
	CCMP89	Ross Casley , Roger F. Crew , José Meseguer , Vaughan R. Pratt, Temporal Structures, Category Theory and Computer Science, p.21-51, September 05-08, 1989
	CDP87	L. Castellano, G. De Michelis, and L. Pomello. Concurrency vs interleaving: an instructive example. Bulletin of the EATCS, 31:12-15, February 1987.
	Ehr63	C. Ehresmann. Categories structurees. Ann. Sci. Ecole Norm. Sup., 80:349-425, 1963.
	Gir87	Jean-Yves Girard, Linear logic, Theoretical Computer Science, v.50 n.1, p.1-102, Jan. 30, 1987 [doi>10.1016/0304-3975(87)90045-4]
	Gla90	R.J. van Glabbeek. Comparative concurrency semantics and refinement of actions. PhD thesis, Vrije Univ., Amsterdam, 1990.
	Gra81	J. Grabowski. On partial languages. Fundamenta Informaticae, IV.2:427-498, 1981.
	GV87	R van Glabbeek , F Vaandrager, Petri net models for algebraic theories of concurrency, Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, p.224-242, March 1987, Eindhoven, The Netherlands
	HU79	John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	Joh87	M. Johnson. Pasting Diagrams in n- Calegories with Applications to Coherence Theorems and Categories of Paths. PhD thesis, Dept. of Pure Mathematics, Sydney University, October 1987.
	KS74	G.M. Kelly and' R. Street. Review of the elements of 2-categories. in L NM ~20. Springer-Verlag, 1974.
	Lam86	L. Lamport. On interprocess communication. Distributed Computing, 1:77-101, 1986.
	Mil80	R. Milner, A Calculus of Communicating Systems, Springer-Verlag New York, Inc., Secaucus, NJ, 1982
	NPW81	M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures, and domains, part I. Theoretical Computer Science, 13, 1981.
	Pap86	Christos Papadimitriou, The theory of database concurrency control, Computer Science Press, Inc., New York, NY, 1986
	Par81	David Park, Concurrency and Automata on Infinite Sequences, Proceedings of the 5th GI-Conference on Theoretical Computer Science, p.167-183, March 23-25, 1981
	Pra82	V. R. Pratt, On the composition of processes, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.213-223, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582177]
	Pra86	Vaughan Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming, v.15 n.1, p.33-71, Feb. 1986 [doi>10.1007/BF01379149]
	Pri70	H.A. Priestley. Representation of distributive lattices. Bull. London Math. Soc., 2:186-190, 1970.
	Rot73	G.-C. Rota. The valuation ring of a distributive lattice. In Proc. Univ. of Houston Lattice Theory Conf. Dept. of Math., Univ. of Houston, 1973.
	Sto36	M. Stone. The theory of representations for Boolean algebras. Trans. Amer. Math. Soc., 40:37-111, 1936.
	Sto37	M. Stone. Topological representations of distributive lattices and brouwerian logics. Casopis P~st. Math., 67:1-25, 1937.
	Str87	R. Street. The algebra of oriented simplexes. Journal of Pure and Applied Algebra, 49:283-335, 1987.
	vGG89	R. van Glabbeek and U. Goltz. Partial order semantics for refinement of actions--neither necessary nor always sufficient but appropriate when used with care. Bulletin of the EATCS, 38:154-163, June 1989_
	Whi49	J.H.C Whitehead. Combinatorial homotopy I. Bull. Amer. Math. Soc., 55:213-245, 1949.
	Whi78	G.W Whitehead. Elements of Homotopy Theory. Springer-Verlag, 1978.
	Win80	G. Winskel. Events in Computation. PhD thesis, Dept. of Computer Science, University of Edinburgh, 1980.

CITED BY 20

	Régis Cridlig, Semantic analysis of shared-memory concurrent languages using abstract model-checking, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.214-225, June 21-23, 1995, La Jolla, California, United States
	Pierpaolo Degano , Corrado Priami, Enhanced operational semantics: a tool for describing and analyzing concurrent systems, ACM Computing Surveys (CSUR), v.33 n.2, p.135-176, June 2001
	Eric Goubault, Schedulers as abstract interpretations of higher-dimensional automata, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.134-145, June 21-23, 1995, La Jolla, California, United States
	Reinhard Schwarz , Friedemann Mattern, Detecting causal relationships in distributed computations: in search of the holy grail, Distributed Computing, v.7 n.3, p.149-174, March 1994
	Paul-André Melliès, Sequential algorithms and strongly stable functions, Theoretical Computer Science, v.343 n.1-2, p.237-281, 10 October 2005
	R. J. van Glabbeek, On the expressiveness of higher dimensional automata, Theoretical Computer Science, v.356 n.3, p.265-290, 30 May 2006
	R. J. van Glabbeek, Erratum: Erratum to “On the expressiveness of higher dimensional automata”, Theoretical Computer Science, v.368 n.1-2, p.168-194, December, 2006
	Stefan Sokołowski, Investigation of concurrent processes by means of homotopy functors, Mathematical Structures in Computer Science, v.12 n.5, p.665-699, October 2002
	Vaughan R. Pratt, Transition and cancellation in concurrency and branching time, Mathematical Structures in Computer Science, v.13 n.4, p.485-529, August 2003
	Eric Goubault, Geometry and concurrency: a user's guide, Mathematical Structures in Computer Science, v.10 n.4, p.411-425, August 2000
	Martin Raussen, On the classification of dipaths in geometric models for concurrency, Mathematical Structures in Computer Science, v.10 n.4, p.427-457, August 2000
	Lisbeth Fajstrup, Loops, ditopology and deadlocks, Mathematical Structures in Computer Science, v.10 n.4, p.459-480, August 2000
	Philippe Gaucher, Homotopy invariants of higher dimensional categories and concurrency in computer science, Mathematical Structures in Computer Science, v.10 n.4, p.481-524, August 2000
	Vaughan Pratt, Higher dimensional automata revisited, Mathematical Structures in Computer Science, v.10 n.4, p.525-548, August 2000
	Lisbeth Fajstrup , Martin Raußen , Eric Goubault, Algebraic topology and concurrency, Theoretical Computer Science, v.357 n.1, p.241-278, 25 July 2006
	Paul-André Melliès, Asynchronous games 2: the true concurrency of innocence, Theoretical Computer Science, v.358 n.2, p.200-228, 7 August 2006
	Lisbeth Fajstrup, Cubical local partial orders on cubically subdivided spaces: existence and construction, Theoretical Computer Science, v.365 n.3, p.199-205, 12 November 2006
	Martin Raußen, Deadlocks and dihomotopy in mutual exclusion models, Theoretical Computer Science, v.365 n.3, p.247-257, 12 November 2006
	José Meseguer , Ugo Montanari , Vladimiro Sassone, On the semantics of place/transition Petri nets, Mathematical Structures in Computer Science, v.7 n.4, p.359-397, August 1997
	Viorica Sofronie-Stokkermans, Sheaves and Geometric Logic and Applications to Modular Verification of Complex Systems, Electronic Notes in Theoretical Computer Science (ENTCS), 230, p.161-187, March, 2009