7109 search results - page 365 / 1422 » Process Algebra with Combinators |
142
click to vote
ENTCS
2007
15 years 6 months ago
2007
Queueing network formalisms are very good at describing the spatial movement of customers, but typically poor at describing how customers change as they move through the network. ...
161
click to vote
TCS
2008
15 years 6 months ago
2008
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
144
click to vote
CLEIEJ
2004
15 years 6 months ago
2004
ept of reconfigurable systems is almost always restricted to the abstract design level, in which configuration languages are used to manipulate software connections. In this paper...
159
click to vote
DEBU
2002
15 years 6 months ago
2002
An increasing number of business users and software applications need to process information that is accessible via multiple diverse information systems, such as database systems,...
158
click to vote
PE
2000
Springer
15 years 6 months ago
2000
Springer
Stochastic process algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all bene...