Gates accept concurrent behavior
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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
This publication has 19 references indexed in Scilit:
- Games semantics for linear logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Refinement of actions and equivalence notions for concurrent systemsActa Informatica, 2001
- Temporal StructuresMathematical Structures in Computer Science, 1991
- A distributed operational semantics for CCS based on condition/event systemsActa Informatica, 1988
- Linear logicTheoretical Computer Science, 1987
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Petri nets, event structures and domains, part ITheoretical Computer Science, 1981
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980
- Finite-Dimensional Vector SpacesPublished by Springer Nature ,1974
- Boolean Algebras with OperatorsAmerican Journal of Mathematics, 1952