335 search results - page 28 / 67 » The Compositional Construction of Markov Processes |
173
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: One of the most powerful methods for the prediction of protein structure from sequence information alone is the iterative construction of profile-type models. Because ...
173
click to vote
IEEESCC
2005
IEEE
15 years 11 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
142
click to vote
DEBS
2010
ACM
15 years 9 months ago
2010
ACM
A new publish/subscribe capability is presented: the ability to predict the likelihood that a subscription will be matched at some point in the future. Composite subscriptions con...
160
click to vote
FMCAD
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
179
click to vote
FORTE
2004
15 years 7 months ago
2004
This paper describes the tool CASPA, a new performance evaluation tool which is based on a Markovian stochastic process algebra. CASPA uses multi-terminal binary decision diagrams ...