## Gates accept concurrent behavior (1993)

Venue: | In Proc. 34th Ann. IEEE Symp. on Foundations of Comp. Sci |

Citations: | 32 - 16 self |

### BibTeX

@INPROCEEDINGS{Gupta93gatesaccept,

author = {Vineet Gupta and Vaughan Pratt},

title = {Gates accept concurrent behavior},

booktitle = {In Proc. 34th Ann. IEEE Symp. on Foundations of Comp. Sci},

year = {1993},

pages = {62--71}

}

### Years of Citing Articles

### OpenURL

### Abstract

We represent concurrent processes as Boolean propositions or gates, cast in the role of acceptors of concurrent behavior. This properly extends other mainstream representations of concurrent behavior such as event structures, yet is defined more simply. It admits an intrinsic notion of duality that permits processes to be viewed as either schedules or automata. Its algebraic structure is essentially that of linear logic, with its morphisms being consequence-preserving renamings of propositions, and with its operations forming the core of a natural concurrent programming language. 1

### Citations

602 | Petri nets: An Introduction - Reisig - 1985 |

326 |
Calculi for synchrony and asynchrony
- Milner
- 1983
(Show Context)
Citation Context ...aving semantics, while one going up several events at a time is called step semantics [DDNM88] (this term motivated by Petri net terminology [Rei85, p.20] and the form of concurrency implicit in SCCS =-=[Mil83]), both be-=-ing weaker [GG89] than partial order semantics [Gre75, Gra81, Pra82]. According to [Pra91, GJ92], a "truly concurrent" trajectory is a homotopy class of paths, meaning a broad but hole-free ... |

267 |
Event structures
- Winskel
- 1986
(Show Context)
Citation Context ... ! y. These are just inclusions between states, all of which we regard as legitimate state transitions. Temporal order: a occurs before b if b ! a. Winskel writes this as a ` b, called prime enabling =-=[Win88b]-=-. If b ! a, then every state with b = 1 must also have a = 1, which means that a must have been set to 1 no later than b. Enabling: General (nonprime) enabling is a; b ` e; c; d ` e j e ! (asb)s(csd) ... |

238 | Modeling concurrency with partial orders - Pratt - 1986 |

200 | Boolean algebras with operators - Jonsson, Tarski - 1952 |

175 |
Petri nets, event structures and domains
- Nielsen, Plotkin, et al.
- 1981
(Show Context)
Citation Context ...tinction was understood as an issue earlier than branching time, the earliest proponents including Petri [Pet62], Greif [Gre75], Mazurkiewicz [Maz77], Grabowski [Gra81], Nielsen, Plotkin, and Winskel =-=[NPW81]-=-, and the second author [Pra82]. Yet the need for this distinction has proved even more controversial than the need for branching time. Here are our reasons for making this distinction. First, the dec... |

131 |
Operational and algebraic semantics of concurrent processes
- Milner
- 1990
(Show Context)
Citation Context ................... ... ... .. .. .. .. .. . . .. . . . .. . . . . . . . . . . . . \Phi \Psi Figure 5. Circuit for Mutual Exclusion 3.2 Comparison with Event Structures In his survey paper on concurrency=-=[Mil90]-=-, Robin Milner says The event structures introduced by Nielsen, Plotkin and Winskel [27] provide an important model in which these different views can be studied in the same framework;. . . This secti... |

130 | Modeling concurrency with geometry
- Pratt
- 1991
(Show Context)
Citation Context ...hing ab + ac in its usual representations, including the regular expression ab + ac itself, contains a repetition of a, while representations of mutex ab + ba typically repeat both a and b. Elsewhere =-=[Pra91]-=- we have used homotopy to give a label-free method of distinguishing true concurrency from mutex by representing the former as the usual product automaton ffl \Gamma \Gamma @ @ ffl @ @ ffl \Gamma \Gam... |

109 | Finite-Dimensional Vector Spaces - Halmos - 1958 |

88 | autonomous categories and linear logic - Barr - 1991 |

84 |
Fundamentals of a Theory of Asynchronous Information Flow
- Petri
- 1963
(Show Context)
Citation Context ...d b into their atomic constituents and identifying akb with ab + ba for atoms a and b. This distinction was understood as an issue earlier than branching time, the earliest proponents including Petri =-=[Pet62]-=-, Greif [Gre75], Mazurkiewicz [Maz77], Grabowski [Gra81], Nielsen, Plotkin, and Winskel [NPW81], and the second author [Pra82]. Yet the need for this distinction has proved even more controversial tha... |

72 |
Equivalence Notions for Concurrent Systems and Refinement of Actions
- Glabbeek, Goltz
- 1989
(Show Context)
Citation Context ...oing up several events at a time is called step semantics [DDNM88] (this term motivated by Petri net terminology [Rei85, p.20] and the form of concurrency implicit in SCCS [Mil83]), both being weaker =-=[GG89] than part-=-ial order semantics [Gre75, Gra81, Pra82]. According to [Pra91, GJ92], a "truly concurrent" trajectory is a homotopy class of paths, meaning a broad but hole-free path, where a hole denotes ... |

55 | Origins of the calculus of binary relations
- Pratt
- 1992
(Show Context)
Citation Context ...s, with dualizing object k, was first defined in Po-Hsiang Chu's master's thesis, which appeared as an appendix to his advisor Michael Barr's monograph on *-autonomous categories [Bar79]. Here and in =-=[Pra93]-=- we follow Lafont and Streicher [LS91] in focusing on Chu's construction for V = Set. In the present paper we further take k = f0; 1g. Numeric quantities are not the only mathematical objects on which... |

50 |
A Calculus of Communicating Systems”. LNCS 92
- Milner
- 1980
(Show Context)
Citation Context ...e once at the beginning of the computation, while time is expressed by the linear order of symbol occurrences or events, also a global notion. Branching time, first raised as an issue by Robin Milner =-=[Mil80]-=-, makes choice a local phenomenon by distinguishing late branching a(b + c) from early branching ab + ac for atomic a and b, an issue that arises for nondeterministic programming languages. This disti... |

48 |
Games Semantics for Linear Logic
- Lafont, Streicher
- 1991
(Show Context)
Citation Context ...efined in Po-Hsiang Chu's master's thesis, which appeared as an appendix to his advisor Michael Barr's monograph on *-autonomous categories [Bar79]. Here and in [Pra93] we follow Lafont and Streicher =-=[LS91]-=- in focusing on Chu's construction for V = Set. In the present paper we further take k = f0; 1g. Numeric quantities are not the only mathematical objects on which one can perform arithmetic. One may a... |

45 |
On partial languages
- Grabowski
- 1981
(Show Context)
Citation Context ...ith ab + ba for atoms a and b. This distinction was understood as an issue earlier than branching time, the earliest proponents including Petri [Pet62], Greif [Gre75], Mazurkiewicz [Maz77], Grabowski =-=[Gra81]-=-, Nielsen, Plotkin, and Winskel [NPW81], and the second author [Pra82]. Yet the need for this distinction has proved even more controversial than the need for branching time. Here are our reasons for ... |

43 | Homology of higher dimensional automata - Goubault, Jensen - 1992 |

36 |
A distributed operational semantics for CCS based on condition/event systems
- Degano, Nicola, et al.
- 1988
(Show Context)
Citation Context ... sequentially. In the "true concurrency" hierarchy, a path or trace going up one event at a time is called interleaving semantics, while one going up several events at a time is called step =-=semantics [DDNM88]-=- (this term motivated by Petri net terminology [Rei85, p.20] and the form of concurrency implicit in SCCS [Mil83]), both being weaker [GG89] than partial order semantics [Gre75, Gra81, Pra82]. Accordi... |

36 |
Curriculum Process
- Wheeler
- 1967
(Show Context)
Citation Context ...ssue earlier than branching time, the earliest proponents including Petri [Pet62], Greif [Gre75], Mazurkiewicz [Maz77], Grabowski [Gra81], Nielsen, Plotkin, and Winskel [NPW81], and the second author =-=[Pra82]-=-. Yet the need for this distinction has proved even more controversial than the need for branching time. Here are our reasons for making this distinction. First, the decomposability premise of trace s... |

29 | Temporal structures - Casley, Crew, et al. - 1991 |

29 |
Semantics of communicating parallel processes
- Greif
- 1975
(Show Context)
Citation Context ...atomic constituents and identifying akb with ab + ba for atoms a and b. This distinction was understood as an issue earlier than branching time, the earliest proponents including Petri [Pet62], Greif =-=[Gre75]-=-, Mazurkiewicz [Maz77], Grabowski [Gra81], Nielsen, Plotkin, and Winskel [NPW81], and the second author [Pra82]. Yet the need for this distinction has proved even more controversial than the need for ... |

27 |
Description of a notation for the logic of relatives, resulting from an amplification of the conceptions of Boole’s calculus of logic, Memoirs of the American Academy of Sciences 9
- Peirce
- 1870
(Show Context)
Citation Context ...ssue earlier than branching time, the earliest proponents including Petri [Pet62], Greif [Gre75], Mazurkiewicz [Maz77], Grabowski [Gra81], Nielsen, Plotkin, and Winskel [NPW81], and the second author =-=[Pra82]-=-. Yet the need for this distinction has proved even more controversial than the need for branching time. Here are our reasons for making this distinction. First, the decomposability premise of trace s... |

21 |
A category of labelled Petri nets and compositional proof system
- Winskel
- 1988
(Show Context)
Citation Context ... can show that event structures can be modeled by gates, for what amount to trivial reasons. An event structure is a set of events E, with a conflict relation # and an enabling relation `, defined in =-=[Win88a]-=-. A configuration is any subset of events which could have occurred in the event structure, so it must be conflict free, and every event must be caused by some previous events in the set according to ... |

12 |
Autonomous categories, LNM 752
- Barr
- 1979
(Show Context)
Citation Context ... associated transforms, with dualizing object k, was first defined in Po-Hsiang Chu's master's thesis, which appeared as an appendix to his advisor Michael Barr's monograph on *-autonomous categories =-=[Bar79]-=-. Here and in [Pra93] we follow Lafont and Streicher [LS91] in focusing on Chu's construction for V = Set. In the present paper we further take k = f0; 1g. Numeric quantities are not the only mathemat... |

11 |
Event structures and domains
- Droste
- 1989
(Show Context)
Citation Context ...ne a labeling function on the gate bys: E ! Act, thus making this embedding respect labeling. The domains that can arise as a family of configurations of an event structure have been characterized in =-=[Dro89]-=- as an algebraic complete partial order with some additional properties. It seems that the restrictions on these domains are placed to match their expressive power to that of Petri nets, and especiall... |

8 |
Concurrent program schemas and their interpretation
- Mazurkiewicz
- 1977
(Show Context)
Citation Context ...d identifying akb with ab + ba for atoms a and b. This distinction was understood as an issue earlier than branching time, the earliest proponents including Petri [Pet62], Greif [Gre75], Mazurkiewicz =-=[Maz77]-=-, Grabowski [Gra81], Nielsen, Plotkin, and Winskel [NPW81], and the second author [Pra82]. Yet the need for this distinction has proved even more controversial than the need for branching time. Here a... |