Weak Markovian Bisimilarity: Abstracting from Prioritized/Weighted Internal Immediate Actions
نویسندگان
چکیده
Markovian process calculi constitute a useful framework for reasoning about the functional and performance aspects of concurrent systems. This is achieved by means of behavioral equivalences that take into account both the action names and their exponentially distributed durations. A notable extension to the expressiveness of Markovian process calculi derives from the adoption of GSPNlike immediate actions, i.e. actions with a zero duration and equipped with a priority level and a weight. Since internal immediate actions are unobservable both from the functional viewpoint and from the performance viewpoint, in this paper we tackle the problem of defining a weak variant of Markovian bisimilarity that abstracts from such actions. We show that the proposed equivalence is a congruence and admits a sound and complete axiomatization for the class of well-prioritized process terms.
منابع مشابه
Expected-Delay-Summing Weak Bisimilarity for Markov Automata
A new weak bisimulation semantics is defined for Markov automata that, in addition to abstracting from internal actions, sums up the expected values of consecutive exponentially distributed delays possibly intertwined with internal actions. The resulting equivalence is shown to be a congruence with respect to parallel composition for Markov automata. Moreover, it turns out to be comparable with...
متن کاملOn the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
Integrated-time Markovian process calculi rely on actions whose durations are quantified by exponentially distributed random variables. The Markovian bisimulation equivalences defined so far for these calculi treat exponentially timed internal actions like all the other actions, because each such action has a nonzero duration and hence can be observed if it is executed between a pair of exponen...
متن کاملTimed process calculi with deterministic or stochastic delays: Commuting between durational and durationless actions
Several deterministically/stochastically timed process calculi have been proposed in the literature that, apart from their synchronization mechanism, mainly differ for the way in which actions and delays are represented. In particular, a distinction is made between integrated-time calculi, in which actions are durational, and orthogonal-time calculi, in which actions are instantaneous and delay...
متن کاملA semi-quantitative equivalence for abstracting from fast reactions
Semantic equivalences are used in process algebra to capture the notion of similar behaviour, and this paper proposes a semi-quantitative equivalence for a stochastic process algebra developed for biological modelling. We consider abstracting away from fast reactions as suggested by the QuasiSteady-State Assumption. We define a fast-slow bisimilarity based on this idea. We also show congruence ...
متن کاملA Companion to Coalgebraic Weak Bisimulation for Action-Type Systems∗
We propose a coalgebraic definition of weak bisimulation for classes of coalgebras obtained from bifunctors in the category Set. Weak bisimilarity for a system is obtained as strong bisimilarity of a transformed system. The particular transformation consists of two steps: First, the behavior on actions is lifted to behavior on finite words. Second, the behavior on finite words is taken modulo t...
متن کامل