Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

R. Mullubhatla

dblp:96/8911 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 87% Embedded and real-time systems · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › markov models
markov reward model
0.012000
Discrete-time Markov reward models of automated manufacturing systems with multiple part types and random rewards · IEEE Trans. Robotics Autom. 2000
Performance modeling and evaluation
performability analysis
0.012000
Discrete-time Markov reward models of automated manufacturing systems with multiple part types and random rewards · IEEE Trans. Robotics Autom. 2000
Embedded and real-time systems › cyber-physical system platforms
industrial automation
0.012000
Discrete-time Markov reward models of automated manufacturing systems with multiple part types and random rewards · IEEE Trans. Robotics Autom. 2000

Methods — techniques the papers use, named apart from their topics

recursive computation · 0.0discrete-time markov chain · 0.0
YearPublicationVenuePosition
2000 Discrete-time Markov reward models of automated manufacturing systems with multiple part types and random rewards
abstract
We consider the discrete-time version of performability modeling of automated manufacturing systems (AMSs) capable of producing multiple part types, when the Markov rewards are random. The discrete-time approach is well suited for the performance studies of AMSs in the presence of failures, repairs, and reconfigurations, AMSs exist in various configuration states and this transitional behavior is modeled using discrete-time Markov chains. In addition, the performance in each configuration state is modeled by a Markov reward structure. The random reward structure models the behavior of real systems more accurately than the deterministic models used in the earlier literature. We derive recursive expressions for the conditional densities and moments of the cumulative performance function and study their asymptotic properties, when the underlying Markov chain describing the evolution of the configuration states is homogenous. Recursions are also derived for the computation of the cross correlation of the productivity of different part types. Examples are provided to illustrate the methods obtained in the paper.
R. Mullubhatla, Krishna R. Pattipati
IEEE Trans. Robotics Autom.1