Partial Order and Contextual Net Semantics for Atomic and Locally Atomic CC Programs

نویسندگان

  • Francisco Bueno
  • Manuel V. Hermenegildo
  • Ugo Montanari
  • Francesca Rossi
چکیده

interpretation. Current work is devoted to defining an abstract contextual process, which finitely represents the possibly infinite set of possibly infinite concrete structures which can be obtained for a given abstract "query mode." Notice that, while the CC schedule analysis can be performed both on eventual and on atomic CC programs (and the corresponding semantic structures), the analysis needed for the CLP parallelization task is only possible on the semantics for atomic CC programs, since this is the only one where nondeterminism can be exchanged for indeterminism, due to the presence of the inconsistency relation. Therefore the main result of this paper, that is, a concurrent semantics for atomic CC programs, is the necessary starting point for exploiting our semantic approach towards the CLP parallelization goal.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Order and Contextual Net

We present two concurrent semantics (i.e. semantics where concurrency is ex-plicitely represented) for CC programs with atomic tells. One is based on simple partial orders of computation steps, while the other one is based on contextual nets and it is an extension of a previous one for eventual CC programs. Both such semantics allow us to derive concurrency, dependency, and nondeterminism infor...

متن کامل

From Eventual to Atomic and Locally Atomic CC Programs: A Concurrent Semantics

Abs t r ac t . We present a concurrent semantics (i.e. a semantics where concurrency is explicitely represented) for CC programs with atomic tells. This allows to derive concurrency, dependency, and nondeterminism information for such languages. The ability to treat failure information puts CLP programs also in the range of applicability of our semantics: although such programs are not concurre...

متن کامل

A Concurrent Semantics for Concurrent Constraint Programs via Contextual Nets

We propose a concurrent semantics for concurrent constraint (cc) programs. A contextual net, that is a net with context conditions, besides pre-and post-conditions, is associated to each cc program. Context conditions are items which have to be present in order for an event to take place, but which are not aaected by the event. They are very useful for describing situations where diierent event...

متن کامل

From Eventual to Atomic Locally Atomic CC Programs: A Concurrent Semantics

We present a concurrent semantics (i.e. a semantics where concurrency is explicitely represented) for CC programs with atomic tells. This allows to derive concurrency, dependency, and nondeterminism information for such languages. The ability to treat failure information puts CLP programs also in the range of applicability of our semantics: although such programs are not concurrent, the concurr...

متن کامل

3. Foundations of Constraint Programming Approaches 3.1 Concurrent Semantics for Concurrent Constraint Programs

A concurrent semantics is a semantics where concurrency can be realistically represented and naturally described. Therefore we believe that every concurrent language should be provided with a formal concurrent semantics. Here we describe three concurrent semantics for concurrent constraint (cc) programs. They are all based on partial order structures relating the various objects involved in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Sci. Comput. Program.

دوره 30  شماره 

صفحات  -

تاریخ انتشار 1998