Gates accept concurrent behavior

Gates accept concurrent behavior (1993)

by Vineet Gupta , Vaughan Pratt

Venue:	In Proc. 34th Ann. IEEE Symp. on Foundations of Comp. Sci
Citations:	30 - 16 self

Datum	Value	Source
TITLE	Gates accept concurrent behavior	INFERENCE
AUTHOR NAME	Vineet Gupta	SVM HeaderParse 0.2
AUTHOR AFFIL	Dept. of Computer Science; Stanford University, CA	SVM HeaderParse 0.2
AUTHOR ADDR	94305	SVM HeaderParse 0.2
AUTHOR NAME	Vaughan Pratt	SVM HeaderParse 0.2
AUTHOR AFFIL	Dept. of Computer Science; Stanford University, CA	SVM HeaderParse 0.2
AUTHOR ADDR	94305	SVM HeaderParse 0.2
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	SVM HeaderParse 0.2
YEAR	1993	INFERENCE
VENUE	In Proc. 34th Ann. IEEE Symp. on Foundations of Comp. Sci	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	62--71	INFERENCE
CITATIONS	24 found	ParsCit 1.0