198 search results - page 37 / 40 » Concurrent Kleene Algebra |
SPAA
1990
ACM
13 years 11 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...
LICS
1998
IEEE
13 years 11 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
FM
2008
Springer
13 years 9 months ago
2008
Springer
TLM (Transaction-Level Modeling) was introduced to cope with the increasing complexity of Systems-on-Chip designs by raising the modeling level. Currently, TLM is primarily used fo...
ACS
2007
13 years 7 months ago
2007
Abstract. For a symmetric monoidal-closed category X and any object K, the category of K-Chu spaces is small-topological over X and small cotopological over Xop . Its full subcateg...
ENTCS
2008
13 years 7 months ago
2008
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...