182 search results - page 3 / 37 » A Theory of Strict P-completeness |
110
Voted
ENTCS
2010
15 years 14 days 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...
66
Voted
STACS
1992
Springer
15 years 4 months ago
1992
Springer
FOSSACS
2001
Springer
15 years 4 months 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 ...
103
Voted
DAM
2008
15 years 14 days 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 ...
112
click to vote
FSTTCS
2004
Springer
15 years 5 months 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...