Constraint-based concurrency and beyond

DOI10.1016/J.ENTCS.2005.12.103zbMATH Open1316.68108OpenAlexW2009648280MaRDI QIDQ5262978FDOQ5262978

Kazunori Ueda

Publication date: 10 July 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.103

Recommendations

• scientific article; zbMATH DE number 2085264
• LMNtal as a hierarchical logic programming language
• Encoding distributed process calculi into LMNtal
• Models for concurrent constraint programming
• Graph rewriting for a partial ordering semantics of concurrent constraints programming

zbMATH Keywords

mobilityconcurrent constraint programmingconcurrent logic programmingmultiset rewritinghierarchical graph rewritingLMNtalconstraint-based concurrency

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Membrane Computing
• Title not available (Why is that?)

Cited In (28)

• The Complexity of Reliable Concurrency Control
• Reflections on the future of concurrency theory in general and process calculi in particular
• Membrane Computing
• Four domains for concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Implementation of Speculative Constraint Processing
• Confluence in concurrent constraint programming
• Restrictions and representations of vector controlled concurrent system behaviours
• Constraints for polymorphic behaviours of concurrent ML
• Theoretical Aspects of Computing – ICTAC 2005
• Hybrid concurrency control for abstract data types
• Constraints meet concurrency
• Title not available (Why is that?)
• Beyond contracts for concurrency
• Cameo: an alternative model of concurrency for Eiffel
• Contractions in comparing concurrency semantics
• Saturation of Concurrent Collapsible Pushdown Systems
• The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
• Quantaloids for concurrency
• Alternation and bounded concurrency are reverse equivalent.
• LMNtal as a Unifying Declarative Language: Live Demonstration
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounded-wait merge in Shapiro's concurrent Prolog
• Title not available (Why is that?)
• GOFFIN: Higher-order functions meet concurrent constraints
• Bisimilarity in concurrent constraint programming

Uses Software

• LMNtal
• GHC

This page was built for publication: Constraint-based concurrency and beyond

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