(Enter summary)
Abstract: This paper ties together three primitivist views of concurrency whose development
the author has had some involvement with, namely the arithmetic
of schedules, the logic of schedule-automaton duality, and the geometry of automata.
Separately each of these views shed considerable light on concurrency.
Our goal here is to bring these three views together coherently in the one place.
The general picture is as follows.
1 2 3
Arithmetic
of
Schedules (Update)
Context of citations to this paper: More
..., e 12 , e 13 , e 21 , e 22 , e 23 . A discussion of further interesting properties of causal histories may be found in [Nie81, Win88, Pra92]. Lemma 2.2 Let e, e E, e e . Causality and causal history are related as follows: 1) e e iff e C(e ) 2) e e iff e C(e...
...e 11 , e 12 , e 13 , e 21 , e 22 , e 23 . A discussion of further interesting properties of causal histories may be found in [51, 57, 73]. Lemma 2.2 Let e, e E, e e . Causality and causal history are related as follows: 1) e e iff e C(e ) 2) e e iff e C(e )...
Cited by: More
Detecting Causal Relationships in Distributed Computations.. - Schwarz, Mattern (1994)
(Correct)
Active bibliography (related documents): More All
0.7: The Duality of Time and Information - Pratt (1992)
(Correct)
0.6: Modeling Concurrency with Geometry - Pratt (1991)
(Correct)
0.5: Linear Logic for Generalized Quantum Mechanics - Pratt (1993)
(Correct)
Similar documents based on text: More All
0.2: Why Gliders Don't Exist: Anti-Reductionism and Emergence - Faith (1998)
(Correct)
0.2: Unknown - Anti-Reductionism There Is
(Correct)
0.1: Does Reductive Proof Theory Have A Viable Rationale? - Feferman (2000)
(Correct)
Related documents from co-citation: More All
2: Causal distributed breakpoints
- Fowler, Zwaenepoel - 1990
2: High level debugging of distributed systems: The behavioral abstraction approach (context) - Bates, Wileden - 1983
2: Implementing and Programming Causal Distributed Shared Memory (context) - Ahamad, Hutto et al. - 1990
BibTeX entry: (Update)
V. Pratt. "Arithmetic + Logic + Geometry = Concurrency". Proc. LATIN'92, I. Simon (ed), Springer-Verlag, LNCS 583, pp. 430-447, 1992. http://citeseer.ist.psu.edu/pratt92arithmetic.html More
@inproceedings{ pratt92arithmetic,
author = "V. R. Pratt",
title = "Arithmetic + Logic + Geometry = Concurrency",
booktitle = "Proc. First Latin American Symposium on Theoretical Informatics",
volume = "583",
publisher = "Springer-Verlag",
address = "S\~{a}o Paulo, Brazil",
pages = "430--447",
year = "1992",
url = "citeseer.ist.psu.edu/pratt92arithmetic.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard - 1987
509
Introduction to Lattices and Order (context) - Davey, Priestley - 1990
168
Theoretical Computer Science (context) - Nielsen, Plotkin et al. - 1981
131
Modeling concurrency with partial orders (context) - Pratt - 1986
54
Modeling concurrency with geometry
- Pratt - 1991
45
Dynamics--The Geometry of Behavior (context) - Abraham, Shaw - 1989
32
A fully abstract semantics for data flow nets (context) - Kok - 1987
27
Topological representations of distributive lattices and bro.. (context) - Stone - 1937
24
Fundamenta Informaticae
- Grabowski, languages - 1981
23
Temporal structures
- Casley, Crew et al. - 1991
23
A fully abstract trace model for dataflow networks (context) - Jonsson - 1989
19
A category of labelled Petri nets and compositional proof sy.. (context) - Winskel - 1988
16
Event spaces and their linear logic
- Pratt - 1991
15
Deterministic asynchronous automata (context) - Shields - 1985
12
the combination of subalgebras (context) - Birkhoff - 1933
12
Duke Mathematical Journal (context) - Birkhoff, arithmetic - 1937
12
Duke Mathematical Journal (context) - Birkhoff - 1942
10
Nets of processes and data flow (context) - Rabinovich, Trakhtenbrot - 1988
8
volume 9 of Colloquium Publications (context) - Birkhoff - 1927
7
Representation of distributive lattices (context) - Priestley - 1970
4
The Theory of Database Control (context) - Papadimitriou - 1986
1
Manuscript available as pub/pp (context) - Plotkin, Pratt et al. - 1988
1
Full abstraction for nondeterministic dataflow networks (context) - Russel - 1989
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