Gates accept concurrent behavior

Authors:
V. Gupta;V. Pratt
Affiliations:
Dept. of Comput. Sci., Stanford Univ., CA, USA;Dept. of Comput. Sci., Stanford Univ., CA, USA
Venue:
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Year:
1993

Citing 0
Cited 6

Event-State Duality: The Enriched Case

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Petri Nets, Configuration Structures and Higher Dimensional Automata

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Configuration structures, event structures and Petri nets

Theoretical Computer Science
A program differencing algorithm for verilog HDL

Proceedings of the IEEE/ACM international conference on Automated software engineering
Linear process algebra

ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Visualizing Boolean operations on a hypercube

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.