An abstract machine for concurrent modular systems: CHARM
From MaRDI portal
Publication:1314422
DOI10.1016/0304-3975(94)90206-2zbMath0801.68055MaRDI 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
operational semantics; concurrency; term rewriting; graph grammars; concurrent constraint programming; place/transition Petri nets; abstract rewriting machine
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q60: Specification and verification (program logics, model checking, etc.)
68Q42: Grammars and rewriting systems
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item