182 search results - page 3 / 37 » A Theory of Strict P-completeness |
ENTCS
2010
13 years 7 months ago
2010
Service oriented computing is an accepted architectural style for developing large, distributed software systems. A particular promise of such architectures is service orchestrati...
STACS
1992
Springer
13 years 11 months ago
1992
Springer
FOSSACS
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four ...
DAM
2008
13 years 7 months ago
2008
This paper presents the axioms of a real time random walk on the set of states of a medium and some of their consequences, such as the asymptotic probabilities of the states. The ...
FSTTCS
2004
Springer
14 years 28 days ago
2004
Springer
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...