150 search results - page 26 / 30 » A bulk-synchronous parallel process algebra |
193
Voted
CCECE
2006
IEEE
15 years 11 months ago
2006
IEEE
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
129
click to vote
SPAA
1990
ACM
15 years 9 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
150
click to vote
CONCUR
1992
Springer
15 years 9 months ago
1992
Springer
Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the "...
222
click to vote
CONCUR
2001
Springer
15 years 10 months ago
2001
Springer
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designate...
129
click to vote
CISIS
2009
IEEE
16 years 8 days ago
2009
IEEE
Abstract. We focus on discrete event systems with a structure of parallel processing, synchronization, and noconcurrency. We use max-plus algebra, which is an effective approach fo...