DocumentCode :
2367062
Title :
Gates accept concurrent behavior
Author :
Gupta, Vineet ; Pratt, Vaughan
Author_Institution :
Dept. of Comput. Sci., Stanford Univ., CA, USA
fYear :
1993
fDate :
3-5 Nov 1993
Firstpage :
62
Lastpage :
71
Abstract :
We represent concurrent processes as Boolean propositions or gates, cast in the role of accepters 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
Keywords :
automata theory; Boolean propositions; accepters; algebraic structure; automata; concurrent behavior; consequence-preserving renamings; duality; event structures; gates; intrinsic notion; linear logic; morphisms; natural concurrent programming language; Automata; Automatic programming; Computer science; Concurrent computing; Ear; Formal languages; Linear programming; Logic functions; Logic programming; Mathematics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
Conference_Location :
Palo Alto, CA
Print_ISBN :
0-8186-4370-6
Type :
conf
DOI :
10.1109/SFCS.1993.366881
Filename :
366881
Link To Document :
بازگشت