2017
DOI: 10.1007/978-3-319-66335-7_2
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting Non-deterministic Analysis in the Integration of Transient Solution Techniques for Markov Regenerative Processes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2
2
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…The software architecture, designed to implement new features of Petri models and new analysis methods, makes ORIS also a flexible research tool to evaluate novel solutions for discrete-event systems. Over the years, ORIS has been successfully used in a variety of contexts and application domains, for instance as a GUI to evaluate performability measures in railway signaling systems [18], as an API to perform sensitivity analysis of maintenance procedures in gas distribution networks [21], and also as a tool to implement a new solution technique for transient analysis of non-Markovian models [10].…”
Section: Discussionmentioning
confidence: 99%
“…The software architecture, designed to implement new features of Petri models and new analysis methods, makes ORIS also a flexible research tool to evaluate novel solutions for discrete-event systems. Over the years, ORIS has been successfully used in a variety of contexts and application domains, for instance as a GUI to evaluate performability measures in railway signaling systems [18], as an API to perform sensitivity analysis of maintenance procedures in gas distribution networks [21], and also as a tool to implement a new solution technique for transient analysis of non-Markovian models [10].…”
Section: Discussionmentioning
confidence: 99%
“…Efficient numerical solution techniques can still be applied with GEN durations if the model guarantees that a new regeneration point is always reached with probability 1 [19], [20], i.e., a time instant where the Markov condition is satisfied, so that future behavior depends on the past only through the discrete logical location. In this case, the underlying stochastic process of the model is a Markov Regenerative Process (MRP), which can be solved with relative efficiency under various restrictions, the most notable being the already mentioned enabling restriction [12], and the bounded regeneration restriction [9], i.e., the number of steps between subsequent regeneration points is bounded.…”
Section: ç 1 Introductionmentioning
confidence: 99%