Graph rewriting for a partial ordering semantics of concurrent constraints programming
DOI10.1016/0304-3975(93)90069-6zbMATH Open0798.68095OpenAlexW2008511866WikidataQ127001668 ScholiaQ127001668MaRDI QIDQ685459FDOQ685459
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
Recommendations
hypergraphconcurrent constraint programminggraph grammarslogic programmingentailmentgraph derivationgraph rewritingpartial ordering semanticstrue-concurrency semantics
Graph theory (including graph drawing) in computer science (68R10) Logic programming (68N17) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)
Cites Work
- Truly concurrent constraint programming
- A structural approach to operational semantics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constraint relaxation may be perfect
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
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)
