Process Algebra for Limited Parallelism
نویسنده
چکیده
An extension of Milner's CCS is presented. The language takes into account a number of resources/processors which have processes at disposal. It enables to consider various distributions and nesting of (sub)processes. Both an operational semantics in Plotkin style and bisimulation semantics for the language are deened. An axiomatiza-tion for nite processes is given, that may be the basis for an automatic proof tool. A relationship to original CCS is discussed.
منابع مشابه
Compositional semantics and behavioral equivalences for P Systems
The aim of the paper is to give a compositional semantics in the style of the Structural Operational Semantics (SOS) and to study behavioral equivalence notions for P Systems. Firstly, we consider P Systems with maximal parallelism and without priorities. We define a process algebra, called P Algebra, whose terms model membranes, we equip the algebra with a Labeled Transition System (LTS) obtai...
متن کاملGilbert: Declarative Sparse Linear Algebra on Massively Parallel Dataflow Systems
In recent years, the generated and collected data is increasing at an almost exponential rate. At the same time, the data’s value has been identified in terms of insights that can be provided. However, retrieving the value requires powerful analysis tools, since valuable insights are buried deep in large amounts of noise. Unfortunately, analytic capacities did not scale well with the growing da...
متن کاملA Time-Delayed-Rendezvous Model for Parallel Discrete Event Simulation
This report extends the model for parallel discrete event simulation presented in [7] by introducing the notion of time. The model is based on the notions of processes and gates and on the rendezvous mechanism defined in the the basic Lotos process algebra[2]. Time is introduced via a mechanism similar to the delay behaviour annotation provided by the Topo toolset[5, 3, 4]. An algorithm is pres...
متن کاملData parallel scheduling of Operations in Linear Algebra on heterogeneous clusters
The aim of data and task parallel scheduling for dense linear algebra kernels is to minimize the processing time of an application composed by several linear algebra kernels. The scheduling strategy presented here combines the task parallelism used when scheduling independent tasks and the data parallelism used for linear algebra kernels. This problem has been studied for scheduling independent...
متن کاملA Uniform Calculus for Collection Types
We present a new algebra for collection types based on monoids and monoid ho-momorphisms. The types supported in this algebra can be any nested composition of collection types, including lists, sets, multisets (bags), vectors, and matrices. We also deene a new calculus for this algebra, called monoid comprehensions, that captures operations involving multiple collection types in declarative for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007