Results 221 to 230 of about 30,211 (267)
Some of the next articles are maybe not open access.
Fundamenta Informaticae, 1996
In the paper Gaussian monoids with zero as a basis for modeling of concurrence and a kind of consistence are proposed and a notion of concurrent system is defined. The main idea is to replace the binary relation of concurrence defined on a set of activities (transitions in Petri nets, events etc.) by a more general notion of independence of multisets.
openaire +2 more sources
In the paper Gaussian monoids with zero as a basis for modeling of concurrence and a kind of consistence are proposed and a notion of concurrent system is defined. The main idea is to replace the binary relation of concurrence defined on a set of activities (transitions in Petri nets, events etc.) by a more general notion of independence of multisets.
openaire +2 more sources
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011
A bi category of very general nondeterministic concurrent games and strategies is presented. The intention is to formalize distributed games in which both Player (or a team of players) and Opponent (or a team of opponents) can interact in highly distributed fashion, without, for instance, enforcing that their moves alternate.
Silvain Rideau, Glynn Winskel
openaire +1 more source
A bi category of very general nondeterministic concurrent games and strategies is presented. The intention is to formalize distributed games in which both Player (or a team of players) and Opponent (or a team of opponents) can interact in highly distributed fashion, without, for instance, enforcing that their moves alternate.
Silvain Rideau, Glynn Winskel
openaire +1 more source
IEEE Design & Test of Computers, 2008
The evolutionary path of microprocessor design includes both multicore and many-core architectures. Harnessing the most computing throughput from these architectures requires concurrent or parallel execution of instructions. The authors describe the challenges facing the industry as parallel-computing platforms become even more widely available.
Wen-mei W. Hwu +2 more
openaire +1 more source
The evolutionary path of microprocessor design includes both multicore and many-core architectures. Harnessing the most computing throughput from these architectures requires concurrent or parallel execution of instructions. The authors describe the challenges facing the industry as parallel-computing platforms become even more widely available.
Wen-mei W. Hwu +2 more
openaire +1 more source
Concurrent Semantics for Concurrent Constraint Programs
1994A 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.
Francesca Rossi 0001, Ugo Montanari
openaire +1 more source
IEEE Transactions on Software Engineering, 1984
With the new advents of technology and the availability of microprocessors and minicomputers, parallel and distributed processing is gaining widespread acceptability. In such systems resources are shared among a number of processes. Accesses to the resources must be synchronized in order to guarantee proper operation of a system. In this research work,
Mohammad G. Khayat +3 more
openaire +1 more source
With the new advents of technology and the availability of microprocessors and minicomputers, parallel and distributed processing is gaining widespread acceptability. In such systems resources are shared among a number of processes. Accesses to the resources must be synchronized in order to guarantee proper operation of a system. In this research work,
Mohammad G. Khayat +3 more
openaire +1 more source
Concurrency and Concurrent Constraint Programming
1995The intent of this paper is to provide the basic ideas and the possible alternatives underlying the task of giving a semantics to a concurrent system/language, and to describe a particular approach which makes some specific choices in order to give a semantics to the class of CC languages.
U. Montanari, ROSSI, FRANCESCA
openaire +2 more sources
Software: Practice and Experience, 1986
Concurrent programming is becoming increasingly important because multicomputers, particularly networks of microprocessors, are rapidly becoming attractive alternatives to traditional maxicomputers. Effective use of such network computers requires that programs be written with components that can be executed in parallel. The C programming language does
Narain H. Gehani, William D. Roome
openaire +2 more sources
Concurrent programming is becoming increasingly important because multicomputers, particularly networks of microprocessors, are rapidly becoming attractive alternatives to traditional maxicomputers. Effective use of such network computers requires that programs be written with components that can be executed in parallel. The C programming language does
Narain H. Gehani, William D. Roome
openaire +2 more sources
1987
A definition of Continuity properly generalized from full to partial orders is presented. In addition to the continuity requirements of Dedekind (no gaps, no jumps) the definition includes requirements taken from physics and from engineering. All these requirements are fulfilled by the total order structure of real numbers, but at the cost of ...
C. A. Petri 0001, Einar Smith
openaire +1 more source
A definition of Continuity properly generalized from full to partial orders is presented. In addition to the continuity requirements of Dedekind (no gaps, no jumps) the definition includes requirements taken from physics and from engineering. All these requirements are fulfilled by the total order structure of real numbers, but at the cost of ...
C. A. Petri 0001, Einar Smith
openaire +1 more source
Concurrent garbage collection for concurrent rewriting
1995We describe an algorithm that achieves garbage collection when performing concurrent rewriting. We show how this algorithm follows the implementation model of concurrent graph rewriting. This model has been studied and directly implemented on MIMD machines where nodes of the graph are distributed over a set of processors.
openaire +1 more source
International Journal on Software Tools for Technology Transfer, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources