A timed semantics of Orc

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

A timed semantics of Orc

Orc is a kernel language for structured concurrent programming. Orc provides three powerful combinators that define the structure of a concurrent computation. These combinators support sequential and concurrent execution, and concurrent execution with blocking and termination. Orc is particularly well-suited for task orchestration, a form of concurrent programming with applications in workflow,...

متن کامل

Token Semantics of Orc

For Orc, a language for orchestrating concurrent computations, a “token semantics” is presented. This semantic model preserves the original program text during evaluation, rather than reducing the given program to its evaluated value.

متن کامل

Event Structure Semantics of Orc

One challenge in developing wide-area distributed applications is analyzing the system’s non-functional properties, including timing constraints and internal dependencies that can affect quality of service. Analysis of non-functional properties requires a precise formal semantics for the language in which the system is written; but labelled transition systems and trace semantics, which are comm...

متن کامل

A Compositional Trace Semantics for Orc

Orc [9] is a language for task orchestration. It has a small set of primitives, but sufficient to express many useful programs succinctly. We identify an ambiguity in the trace semantics of Kitchin et al. [9]. We give possible interpretations of the ambiguous definition and show that the semantics is not adequate regardless of the interpretation. We remedy this situation by providing new operat...

متن کامل

Semantics of Timed Concurrent Systems

A truly concurrent and timeless semantics is proposed for a composition of sequential, non-deterministic processes with asynchronous communication. It is shown when this semantics differs from simple interleaving. Implementation-dependent time constraints determine a subset of all computations of the timeless semantics. This set is precisely characterized for given constraints. It is shown how ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2008

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2008.04.037