Abstract

We present a concurrent semantics for concurrent constraint (CC) programs with both (“committed choice”) indeterminism and (“back-tracking”) nondeterminism. The semantics extends the previous semantics for Indeterminate CC by (1) allowing each state to contain different or-parallel components and (2) splitting the concurrency relation into two to distinguish between and- and or-concurrency. Thereby, the construction produces a single representation (an And-or contextual net) that captures all the significant relations between events in program runs: concurrency, causal dependency, indeterminism and nondeterminism. We believe this is a first step towards the formal analysis of the concurrent semantics of practical CC languages containing both in- and non-determinism, such as AKL [HJ90].

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.