2-components machine
Can you help me just making me understand the point?
I have a 2-components machine. Both components have independent lifetimes, distributed as exponential r.v. with expected value $mu$ = 5. To make a job they simultaneously work and, if components break, they will be fixed simultaneously (there are moments in which just a component is working).
Considering X(t) the number of functioning componet at time t (t>0), compute:
lim (t--> ∞) of P[X(t+s) = 1] for every s in [0,5]
I don't understand why it should be different from computing the limit of P[X(t) = 1], which is a previous point.
Can you help me understanding this?
probability stochastic-processes
New contributor
add a comment |
Can you help me just making me understand the point?
I have a 2-components machine. Both components have independent lifetimes, distributed as exponential r.v. with expected value $mu$ = 5. To make a job they simultaneously work and, if components break, they will be fixed simultaneously (there are moments in which just a component is working).
Considering X(t) the number of functioning componet at time t (t>0), compute:
lim (t--> ∞) of P[X(t+s) = 1] for every s in [0,5]
I don't understand why it should be different from computing the limit of P[X(t) = 1], which is a previous point.
Can you help me understanding this?
probability stochastic-processes
New contributor
Don't we have to know how long it takes to fix a component?
– saulspatz
2 days ago
@saulspatz components are fixed simultaneously and immediatly, we can ignore fixing time
– CronoPound
yesterday
add a comment |
Can you help me just making me understand the point?
I have a 2-components machine. Both components have independent lifetimes, distributed as exponential r.v. with expected value $mu$ = 5. To make a job they simultaneously work and, if components break, they will be fixed simultaneously (there are moments in which just a component is working).
Considering X(t) the number of functioning componet at time t (t>0), compute:
lim (t--> ∞) of P[X(t+s) = 1] for every s in [0,5]
I don't understand why it should be different from computing the limit of P[X(t) = 1], which is a previous point.
Can you help me understanding this?
probability stochastic-processes
New contributor
Can you help me just making me understand the point?
I have a 2-components machine. Both components have independent lifetimes, distributed as exponential r.v. with expected value $mu$ = 5. To make a job they simultaneously work and, if components break, they will be fixed simultaneously (there are moments in which just a component is working).
Considering X(t) the number of functioning componet at time t (t>0), compute:
lim (t--> ∞) of P[X(t+s) = 1] for every s in [0,5]
I don't understand why it should be different from computing the limit of P[X(t) = 1], which is a previous point.
Can you help me understanding this?
probability stochastic-processes
probability stochastic-processes
New contributor
New contributor
New contributor
asked 2 days ago
CronoPound
11
11
New contributor
New contributor
Don't we have to know how long it takes to fix a component?
– saulspatz
2 days ago
@saulspatz components are fixed simultaneously and immediatly, we can ignore fixing time
– CronoPound
yesterday
add a comment |
Don't we have to know how long it takes to fix a component?
– saulspatz
2 days ago
@saulspatz components are fixed simultaneously and immediatly, we can ignore fixing time
– CronoPound
yesterday
Don't we have to know how long it takes to fix a component?
– saulspatz
2 days ago
Don't we have to know how long it takes to fix a component?
– saulspatz
2 days ago
@saulspatz components are fixed simultaneously and immediatly, we can ignore fixing time
– CronoPound
yesterday
@saulspatz components are fixed simultaneously and immediatly, we can ignore fixing time
– CronoPound
yesterday
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
CronoPound is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060745%2f2-components-machine%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
CronoPound is a new contributor. Be nice, and check out our Code of Conduct.
CronoPound is a new contributor. Be nice, and check out our Code of Conduct.
CronoPound is a new contributor. Be nice, and check out our Code of Conduct.
CronoPound is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060745%2f2-components-machine%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Don't we have to know how long it takes to fix a component?
– saulspatz
2 days ago
@saulspatz components are fixed simultaneously and immediatly, we can ignore fixing time
– CronoPound
yesterday