An abstract machine for concurrent modular systems: CHARM

DOI10.1016/0304-3975(94)90206-2zbMath0801.68055OpenAlexW1989969984MaRDI QIDQ1314422

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

operational semanticsconcurrencyterm rewritinggraph grammarsconcurrent constraint programmingplace/transition Petri netsabstract rewriting machine

Mathematics Subject Classification ID

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

Related Items (5)

Network Conscious π-calculus: A Concurrent Semantics ⋮ Ugo Montanari and Graph Transformation ⋮ Models of Computation: A Tribute to Ugo Montanari’s Vision ⋮ A network-conscious \(\pi\)-calculus and its coalgebraic semantics ⋮ On GS-Monoidal Theories for Graphs with Nesting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri nets are monoids
• Sequential and concurrent behaviour in Petri net theory
• Conditional rewriting logic as a unified model of concurrency
• The chemical abstract machine
• An algebraic semantics for structured transition systems and its application to logic programs
• Truly concurrent constraint programming
• Contextual nets
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

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