Graph rewriting for a partial ordering semantics of concurrent constraints programming

DOI10.1016/0304-3975(93)90069-6MaRDI QIDQ685459zbMATH OpenOpenAlexWikidataFDO

Authors Ugo Montanari, Francesca Rossi

Publication date 31 October 1994

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

Full work available at URL https://doi.org/10.1016/0304-3975(93)90069-6

zbMATH Keywords

hypergraphconcurrent constraint programminggraph grammarslogic programmingentailmentgraph derivationgraph rewritingpartial ordering semanticstrue-concurrency semantics

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic programming (68N17) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• Truly concurrent constraint programming
• An event structure semantics for graph grammars with parallel productions
• scientific article; zbMATH DE number 1231496
• Models for concurrent constraint programming
• scientific article; zbMATH DE number 4049016

Cites work

• scientific article; zbMATH DE number 1638651 (Why is no real title available?)
• scientific article; zbMATH DE number 1638652 (Why is no real title available?)
• 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 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 177436 (Why is no real title available?)
• scientific article; zbMATH DE number 177840 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• A structural approach to operational semantics
• Constraint relaxation may be perfect
• Truly concurrent constraint programming

Cited in

(5)

• scientific article; zbMATH DE number 1231489 (Why is no real title available?)
• A truly concurrent semantics for the \(\mathbb{K}\) framework based on graph transformations
• Contextual occurrence nets and concurrent constraint programming
• Constraint-based concurrency and beyond
• Graph-grammar semantics of a higher-order programming language for distributed systems

This page was built for publication: Graph rewriting for a partial ordering semantics of concurrent constraints programming

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