6 research outputs found
Weak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Concurrent Processes
We have recently defined a weak Markovian bisimulation equivalence in an
integrated-time setting, which reduces sequences of exponentially timed
internal actions to individual exponentially timed internal actions having the
same average duration and execution probability as the corresponding sequences.
This weak Markovian bisimulation equivalence is a congruence for sequential
processes with abstraction and turns out to induce an exact CTMC-level
aggregation at steady state for all the considered processes. However, it is
not a congruence with respect to parallel composition. In this paper, we show
how to generalize the equivalence in a way that a reasonable tradeoff among
abstraction, compositionality, and exactness is achieved for concurrent
processes. We will see that, by enhancing the abstraction capability in the
presence of concurrent computations, it is possible to retrieve the congruence
property with respect to parallel composition, with the resulting CTMC-level
aggregation being exact at steady state only for a certain subset of the
considered processes.Comment: In Proceedings QAPL 2012, arXiv:1207.055
Compositional Performance Modelling with the TIPPtool
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 beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end. Apart from highlighting the general benefits of the tool, we also discuss some lessons learned during development and application of the TIPPtool. A non-trivial model of a real life communication system serves as a case study to illustrate benefits and limitations
Proportional lumpability and proportional bisimilarity
3noIn this paper, we deal with the lumpability approach to cope with the state space explosion problem inherent to the computation of the stationary performance indices of large stochastic models. The lumpability method is based on a state aggregation technique and applies to Markov chains exhibiting some structural regularity. Moreover, it allows one to efficiently compute the exact values of the stationary performance indices when the model is actually lumpable. The notion of quasi-lumpability is based on the idea that a Markov chain can be altered by relatively small perturbations of the transition rates in such a way that the new resulting Markov chain is lumpable. In this case, only upper and lower bounds on the performance indices can be derived. Here, we introduce a novel notion of quasi-lumpability, named proportional lumpability, which extends the original definition of lumpability but, differently from the general definition of quasi-lumpability, it allows one to derive exact stationary performance indices for the original process. We then introduce the notion of proportional bisimilarity for the terms of the performance process algebra PEPA. Proportional bisimilarity induces a proportional lumpability on the underlying continuous-time Markov chains. Finally, we prove some compositionality results and show the applicability of our theory through examples.openopenMarin A.; Piazza C.; Rossi S.Marin, A.; Piazza, C.; Rossi, S
A uniform framework for modelling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
Labeled transition systems are typically used as behavioral models of concurrent processes, and the labeled transitions define the a one-step state-to-state reachability relation. This model can be made generalized by modifying the transition relation to associate a state reachability distribution, rather than a single target state, with any pair of source state and transition label. The state reachability distribution becomes a function mapping each possible target state to a value that expresses the degree of one-step reachability of that state. Values are taken from a preordered set equipped with a minimum that denotes unreachability. By selecting suitable preordered sets, the resulting model, called ULTraS from Uniform Labeled Transition System, can be specialized to capture well-known models of fully nondeterministic processes (LTS), fully
probabilistic processes (ADTMC), fully stochastic processes (ACTMC), and of nondeterministic and probabilistic (MDP) or nondeterministic and stochastic (CTMDP) processes. This uniform treatment of different behavioral models extends to behavioral equivalences. These can be defined on ULTraS by relying on appropriate measure functions that expresses the degree of reachability of a set of states when performing
single-step or multi-step computations. It is shown that the specializations of bisimulation, trace, and testing
equivalences for the different classes of ULTraS coincide with the behavioral equivalences defined in the literature over traditional models
Weak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Sequential Processes
none1noThe Markovian behavioral equivalences defined so far treat exponentially timed internal actions like any other action. Since an exponentially timed internal action has a nonzero duration, it can be observed whenever it is executed between a pair of exponentially timed noninternal actions. However, no difference may be noted at steady state between a sequence of exponentially timed internal actions and a single exponentially timed internal action as long as their average durations coincide. We show that Milnerâs construction to derive a weak bisimulation congruence for nondeterministic processes can be extended to sequential Markovian processes in a way that captures the above situation. The resulting weak Markovian bisimulation congruence admits a sound and complete axiomatization, induces an exact CTMC-level aggregation at steady state, and is decidable in polynomial time for finite-state processes having no cycles of exponentially timed internal actions.mixedBernardo, MarcoBernardo, Marc