Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '90 1990
DOI: 10.1145/96709.96717
|View full text |Cite
|
Sign up to set email alerts
|

The chemical abstract machine

Abstract: We introduce a new kind of abstract machine based on the chemical metaphor used in the l? language of Ban%tre & al. States of a machine are chemical solutions where floating molecules can interact according to reaction rules. Solutions can be stratified by encapsulating subsolutions within membranes that force reactions to occur locally. We illustrate the use of this model by describing the operational semantics of the TCCS and CCS process calculi. We also show how to extract a higher-order concurrent &calculu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
128
0
1

Year Published

1995
1995
2017
2017

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 243 publications
(129 citation statements)
references
References 10 publications
(1 reference statement)
0
128
0
1
Order By: Relevance
“…Richer process calculi exist, such as the Join-calculus [FG96] (and its extension to mobility [FGL + 96]) based on the reflexive CHAM (CHemical Abstract Machine) [BB92] and also the Ambient calculus [CG98]. They allow the description of separated membranes/domains, where processes interact with each other within a domain or perform explicit actions to move in or out of domains.…”
Section: Process Calculimentioning
confidence: 99%
“…Richer process calculi exist, such as the Join-calculus [FG96] (and its extension to mobility [FGL + 96]) based on the reflexive CHAM (CHemical Abstract Machine) [BB92] and also the Ambient calculus [CG98]. They allow the description of separated membranes/domains, where processes interact with each other within a domain or perform explicit actions to move in or out of domains.…”
Section: Process Calculimentioning
confidence: 99%
“…There are different approaches to nature-inspired computing: reaction-diffusion computing [8][9][10]; chemical computing [11]; biological computing [12,13]; and so on. In all these computational models, parallel inferring and concurrency are assumed as key notions.…”
Section: The Proof-theoretic Cellular Automaton For Belousov-zhabotinmentioning
confidence: 99%
“…Comparison with the existing models should be done and possibility of their utilization should be considered. In particular, so-called P-systems [8,24,[92][93][94][95] and (M,R)-systems [28,72,[103][104][105] should be taken into consideration.…”
Section: Introduction Of Formal Definitions Of the Proposed Termsmentioning
confidence: 99%