946 search results - page 150 / 190 » Process Algebra and Non-Interference |
187
click to vote
BIRTHDAY
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
163
click to vote
GECCO
2009
Springer
16 years 16 days ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
162
click to vote
DDECS
2008
IEEE
16 years 13 days ago
2008
IEEE
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
173
click to vote
B
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. CSP B is an integration of the process algebra Communicating Sequential Processes (CSP), and the B-Method, which enables consistent controllers to be written for B machin...
168
click to vote
IEEEARES
2006
IEEE
16 years 6 hour ago
2006
IEEE
The µKlaim calculus is a process algebra designed to study the programming of distributed systems consisting of a number of locations each having their own tuple space and collec...