An abstract machine for concurrent modular systems: CHARM

DOI10.1016/0304-3975(94)90206-2MaRDI QIDQ1314422zbMATH OpenOpenAlexFDO

Authors Andrea Corradini, Ugo Montanari, Francesca Rossi

Publication date 22 February 1994

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)90206-2

zbMATH Keywords

concurrencyterm rewritingconcurrent constraint programminggraph grammarsoperational semanticsplace/transition Petri netsabstract rewriting machine

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 970734
• The chemical abstract machine
• Concurrent abstract state machines

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3825182 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 4049095 (Why is no real title available?)
• scientific article; zbMATH DE number 3677208 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 517053 (Why is no real title available?)
• scientific article; zbMATH DE number 970734 (Why is no real title available?)
• An algebraic semantics for structured transition systems and its application to logic programs
• Conditional rewriting logic as a unified model of concurrency
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Contextual nets
• Petri nets are monoids
• Sequential and concurrent behaviour in Petri net theory
• The chemical abstract machine
• Truly concurrent constraint programming

Cited in

(5)

• Ugo Montanari and Graph Transformation
• A network-conscious \(\pi\)-calculus and its coalgebraic semantics
• Models of Computation: A Tribute to Ugo Montanari’s Vision
• Network Conscious π-calculus: A Concurrent Semantics
• On GS-monoidal theories for graphs with nesting

This page was built for publication: An abstract machine for concurrent modular systems: CHARM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314422)