See this document in CiteSeerX!

Modeling Concurrency with Geometry (1991)  (Make Corrections)  (54 citations)
Vaughan Pratt
Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
stanford.edu/pub/cg.ps.gz
ens.fr/~goubault/papers/cg.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  stanford.edu/abstracts (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The phenomena of branching time and true or noninterleaving concurrency find their respective homes in automata and schedules. But these two models of computation are formally equivalent via Birkhoff duality, an equivalence we expound on here in tutorial detail. So why should these phenomena prefer one home over the other? We identify dimension as the culprit: 1dimensional automata are skeletons permitting only interleaving concurrency, whereas true n-fold concurrency resides in transitions of... (Update)

Context of citations to this paper:   More

.... There is another ostensibly altogether di erent approach to the essence of concurrency, that of higher dimensional automata [Pra91,GJ92,FGR98,Gou00]. It is however possible to reconcile this approach with the Chu space approach by working with couples over 3, that is, a...

...metrics of [4] leaving this as a loose end. In between [4] and [1] we introduced the notion of higher dimensional automaton (HDA) [6] as an algebraic topological form of automata theory supporting Papadimitriou s geometric view of concurrency control [7] in terms of...

Cited by:   More
Asynchronous Games 2 - The true concurrency of innocence - Mellies (2004)   (Correct)
Software Geography: Physical and Economic - Aspects Vaughan Pratt   (Correct)
The branching nerve of HDA and the Kan condition - Gaucher (2003)   (Correct)

Active bibliography (related documents):   More   All
0.7:   Refinement of Actions and Equivalence Notions for Concurrent .. - van Glabbeek, Goltz (1998)   (Correct)
0.6:   Arithmetic + Logic + Geometry = Concurrency - Vaughan Pratt (1992)   (Correct)
0.6:   The Duality of Time and Information - Pratt (1992)   (Correct)

Similar documents based on text:   More   All
0.2:   Higher Dimensional Automata Revisited - Vaughan Pratt Department (2000)   (Correct)
0.1:   On The Specification Of Concurrent Systems - Casley (1991)   (Correct)
0.1:   3D Computer AnimationWorkshop, Siggraph'98 Course #34 Notes - O'Rourke (1998)   (Correct)

Related documents from co-citation:   More   All
25:   Homology of Higher-Dimensional Automata - GOUBAULT, JENSEN - 1992
14:   Theoretical Computer Science (context) - Nielsen, Plotkin et al. - 1981
12:   An introduction to event structures (context) - Winskel - 1989

BibTeX entry:   (Update)

V. Pratt. Modeling concurrency with geometry. In D. Wise, editor, Principles of programming languages, proceedings of the eighteenth annual ACM symposium, pages 311--322, New York, 1991. ACM Press. http://citeseer.ist.psu.edu/pratt91modeling.html   More

@inproceedings{ pratt91modeling,
    author = "Vaughan R. Pratt",
    title = "Modeling Concurrency with Geometry",
    booktitle = "Conference Record of the Eighteenth Annual {ACM} Symposium on Principles of Programming Languages",
    address = "Orlando, Florida",
    pages = "311--322",
    year = "1991",
    url = "citeseer.ist.psu.edu/pratt91modeling.html" }
Citations (may not include all citations):
1911   Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
982   Theoretical Computer Science (context) - Girard - 1987  ACM
502   Concurrency and automata on infinite sequences (context) - Park - 1981  ACM   DBLP
484   A Calculus of Communicating Systems (context) - Milner - 1980
168   Theoretical Computer Science (context) - Nielsen, Plotkin et al. - 1981  ACM
131   Modeling concurrency with partial orders (context) - Pratt - 1986  ACM
80   Review of the elements of 2-categories (context) - Kelly, Street - 1974
75   On interprocess communication - Lamport - 1986
57   Petri net models for algebraic theories of concurrency (context) - van Glabbeek, Vaandrager - 1987  ACM   DBLP
47   Comparative Concurrency Semantics and Refinement of Actions (context) - van Glabbeek - 1990
39   The theory of representations for Boolean algebras (context) - Stone - 1936
33   The algebra of oriented simplexes (context) - Street - 1987
31   Process theory based on bisimulation semantics (context) - Bergstra, Klop - 1989  ACM   DBLP
31   Elements of Homotopy Theory (context) - Whitehead - 1978
27   the composition of processes (context) - Pratt - 1982
27   Topological representations of distributive lattices and bro.. (context) - Stone - 1937
26   University of Edinburgh (context) - Winskel, Computation et al. - 1980
24   Fundamenta Informaticae - Grabowski, languages - 1981
23   Temporal structures - Casley, Crew et al. - 1991  ACM   DBLP
15   Deterministic asynchronous automata (context) - Shields - 1985  ACM   DBLP
12   the combination of subalgebras (context) - Birkhoff - 1933
12   Topology: A geometric account of general topology (context) - Brown - 1988
7   Representation of distributive lattices (context) - Priestley - 1970
6   Concurrency vs interleaving: an instructive example (context) - Castellano, De Michelis et al. - 1987
4   The Theory of Database Control (context) - Papadimitriou - 1986
4   Combinatorial homotopy (context) - Whitehead - 1949
3   The valuation ring of a distributive lattice (context) - Rota - 1973
3   Categories structurees (context) - Ehresmann - 1963
2   Partial order semantics for refinement of actions---neither .. (context) - van Glabbeek, Goltz - 1989
1   Pasting Diagrams in nCategories with Applications to Coheren.. - Johnson - 1987



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://boole.stanford.edu/abstracts.html):   More
Origins of the Calculus of Binary Relations - Pratt (1992)   (Correct)
Branching Bisimulation as a Tool in the Analysis of Weak.. - van Glabbeek (1995)   (Correct)
Action Logic and Pure Induction - Pratt (1991)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC