198 search results - page 22 / 40 » Concurrent Kleene Algebra |
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems. We study the impact this new kind of actions has on fairnes...
DEXAW
2004
IEEE
13 years 11 months ago
2004
IEEE
Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among ...
IEEEARES
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract—Abstract virology has seen the apparition of successive viral models, all based on Turing-equivalent formalisms. Considering recent malware, these are only partially cov...
CONCUR
2001
Springer
14 years 1 days ago
2001
Springer
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...