24 search results - page 4 / 5 » Fair Synchronous Transition Systems and Their Liveness Proof... |
DC
2010
13 years 5 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
ECAI
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. There are many examples of intelligent and learning systems that are based either on the connectionist or the symbolic approach. Although the latter can be successfully c...
DSRT
1999
IEEE
13 years 10 months ago
1999
IEEE
This paper describes a variant of the actor model suited to the development of multimedia systems. The actor model centers on non-overkilling concurrency and customizable constrai...
FORTE
1994
13 years 7 months ago
1994
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
NCA
2007
IEEE
14 years 1 days ago
2007
IEEE
Exponentially growing bandwidth requirements and slowing gains in processor speeds have led to the popularity of multiprocessor architectures. Network stack parallelism is increas...