Graph rewriting for a partial ordering semantics of concurrent constraints programming

DOI10.1016/0304-3975(93)90069-6zbMath0798.68095OpenAlexW2008511866WikidataQ127001668 ScholiaQ127001668MaRDI QIDQ685459

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

hypergraphgraph rewritinglogic programminggraph grammarsentailmentconcurrent constraint programminggraph derivationpartial ordering semanticstrue-concurrency semantics

Mathematics Subject Classification ID

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

Related Items

Graph-grammar semantics of a higher-order programming language for distributed systems ⋮ Contextual occurrence nets and concurrent constraint programming

Cites Work

• Truly concurrent constraint programming
• A structural approach to operational semantics
• Constraint relaxation may be perfect
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item