An abstract machine for concurrent modular systems: CHARM
type: Item
instance of: scholarly article
title: An abstract machine for concurrent modular systems: CHARM
zbMATH Open document ID: 0801.68055
DOI: 10.1016/0304-3975(94)90206-2
author: Andrea Corradini
author: Ugo Montanari
author: Francesca Rossi
published in: Theoretical Computer Science
publication date: 1994-02-22T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 501223
zbMATH Keywords: concurrency
zbMATH Keywords: abstract rewriting machine
zbMATH Keywords: operational semantics
zbMATH Keywords: term rewriting
zbMATH Keywords: graph grammars
zbMATH Keywords: concurrent constraint programming
zbMATH Keywords: place/transition Petri nets
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90206-2
OpenAlex ID: W1989969984
cites work: The chemical abstract machine
cites work: Sequential and concurrent behaviour in Petri net theory
cites work: Q4282581
cites work: An algebraic semantics for structured transition systems and its application to logic programs
cites work: Q5688924
cites work: Q3785984
cites work: Q3777424
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Q3339245
cites work: Conditional rewriting logic as a unified model of concurrency
cites work: Petri nets are monoids
cites work: Q3992568
cites work: Contextual nets
cites work: Q3873555
cites work: Q3670575
cites work: Truly concurrent constraint programming
cites work: Q3959414
description: scientific article; zbMATH DE number 501223