Modeling concurrency with geometry

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1991, Pages 311-322

  Pratt, Vaughan ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

CONCURRENT AUTOMATA; DISTRIBUTIVE LATTICE; EVENT STRUCTURES; FORMAL DEFINITION; HIGHER DIMENSIONAL AUTOMATA; INTERLEAVING CONCURRENCY; MODELS OF COMPUTATION; NON-DETERMINISM;

AUTOMATA THEORY;

EID: 85023139759     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99583.99625     Document Type: Conference Paper

References (29)

1. G. Birkhoff. On the combination of subalgebras. Proc. Cambridge Phil. Sot, 29:441-464, 1935
2. J.A. Bergstra and J.W. Klop. Process theory based on bisimulation semantics. In Proc. REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, pages 50-122, Noordwijkerhout, The Netherlands, 1989. Springer-Verlag.
3. R. Brown. Topology: A geometric account of generai topology, homotopy types and the fundamental groupoid. Halsted Press, New York, 1988.
4. R.T Casley, R.F. Crew, J. Meseguer, and V.R. Pratt. Temporal structures. In Proc. Conf. on Category Theory and Computer Science,.LNCS, Manchester, September 1989. Springer-Verlag. Revised version to appear in Math. Structures in Comp. Sci., 1:1.
5. L. Castellano, G. De Michelis, and L. Pomello. Concurrency vs interleaving: An instructive example. Bulletin of the EATCS, 31:12-15, February 1987.
6. C. Ehresmann. Categories structures. Ann. Sci. Ecole Norm. Sup., 80:349-425, 1963.
7. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
8. R.J. van Glabbeek. Comparative concurrency semantics and refinement of actions. PhD thesis, Vrije Univ., Amsterdam, 1990.
9. J. Grabowski. On partial languages. Fundamental Informaticae, lV.2:427-498, 1981.
10. R.J. van Glabbeek and F.W. Vaandrager. Petri net models for algebraic theories of concurrency. In Proc. PARLE, II, LNCS 259, pages 224-242. Springer-Verlag, 1987.
11. J.E. Hopcroft and J.D. Unman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
12. M. Johnson. Pasting Diagrams in n-Categories with Applications to Coherence Theorems and Categories of Paths. Pm thesis, Dept. of Pure Mathematics, Sydney University, October 1987.
13. G.M. Kelly and R. Street. Review of the elements of 2-categories, In LNM 420. Springer-Verlag, 1974.
14. L. Lamport. On interprocess communication. Distributed Computing, 1:77-101, 1986.
15. R. Milner. Calculus of Communicating Behavior, LNCS 92. Springer-Verlag, 1980.
16. M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures, and domains, part I. Theoretical Computer Science, 13, 1981.
17. C. Papadimitriou. The Theory of Database Control. Computer Science Press, 1986.
18. D. Park. Concurrency and automata on infinite sequences. In Proc. Theoretical Computer Science, LNCS 104, pages 167-183. Springer-Verlag, 1981.
19. V.R. Pratt. On the composition of processes. In Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages, January 1982.
20. V.R. Pratt. Modeling concurrency with partiaI orders. International Journal of Parallel Programming, 15(1):33-71, February 1986.
21. H.A. Priestley. Representation of distributive lattices. Bull. London Math. Sot., 2:186-190, 1970.
22. 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.
23. M. Stone. The theory of representations for Boolean algebras. Trans. Amer. Math. Sot., 40:37-111, 1936.
24. M. Stone. Topological representations of distributive lattices and brouwerian logics. asopis Ptt. Math., 67:1-25, 1937.
25. R. Street. The algebra of oriented simplexes. Journal of Pure and Applied Algebra, 49:283-335, 1987.
26. 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 EAT(X), 38:154-163, June 1989.
27. J.H.C Whitehead. Combinatorial homotopy I. Bull. Amer. Math. Sot., 55:213-245, 1949.
28. G.W Whitehead. Elements of Homotopy Theory. Springer-Verlag, 1978.
29. G. Winskel. Events in Computation. PhD thesis, Dept. of Computer Science, University of Edinburgh, 1980.