608 search results - page 37 / 122 » The Expressive Power of Simple Parallelism |
79
Voted
SEMWEB
2004
Springer
15 years 3 months ago
2004
Springer
In 1984, Peter Patel-Schneider published a paper [1] entitled Small can be Beautiful in Knowledge Representation in which he advocated for limiting the expressive power of knowledg...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
IOPADS
1996
14 years 11 months ago
1996
Many parallel scientific applications need high-performance I/O. Unfortunately, end-to-end parallel-I/O performance has not been able to keep up with substantial improvements in p...
108
click to vote
CONCUR
2005
Springer
15 years 3 months ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
110
click to vote
IFIP
2010
Springer
14 years 4 months ago
2010
Springer
Modern embedded systems are often heterogeneous in that their design requires several description paradigms, based on different models of computation and concurrency (MoCCs). In th...