5171 search results - page 128 / 1035 » Deterministic Parallel Processing |
CONCUR
2008
Springer
13 years 10 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
CONCUR
2001
Springer
14 years 21 days ago
2001
Springer
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
ICDCS
1994
IEEE
14 years 9 days ago
1994
IEEE
The design of a process migration mechanism for the Amoeba distributed operating system is described. The primary motivation for this implementation is to carry out experimental a...
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...