G# otz, N., Herzog, U., and Rettelbach, M. TIPP---Introduction and application to protocol performance analysis. In Formale Beschreibungstechniken f#ur verteilte Systeme #Munich 1993#, H. K#onig, Ed., FOKUS, Saur-Verlag.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and verification of systems. Notable examples are Petri Nets and their quantitative extensions mentioned in Sect. 2. 2, and Process Algebras and their timed, probabilistic and stochastic extensions [Brinksma et al. 1995; Brinksma et al. 1998; D Argenio et al. 1998a; D Argenio et al. 1998b; Gotz et al. 1993; Harrison and Strulo 1995. Hillston 1996; Nicollin and Sifakis 1991] The possibility of having both functional and quantitative aspects of (a critical part of) a system within the very same notation is extremely interesting and convenient since it fills the gap which usually separates formal ....

N. Gotz, U. Herzog and M. Rattelbach. "TIPP - Introduction and application to protocol performance analysis.," in Formale Beschreibungstechniken fur verteilte Systems. FOKUS series., ed. H. Konig, pp. Saur Publishers, 1993.

.... to introduce quantitative behaviour include a global timing variable to represent constant time in the specification [23, 26] Such a method is normally not adequate to specify and analyse the performance or reliability of complex systems, more appropriate are random durations as explained in [11, 12]. Therefore it seems to be more promising to follow the approaches from the Petri net area and enhance process algebras with stochastic timing. Approaches have been very recently published [11, 12, 13, 16] In particular the European QMIPS project [15] investigates this idea. Approaches which ....

....performance or reliability of complex systems, more appropriate are random durations as explained in [11, 12] Therefore it seems to be more promising to follow the approaches from the Petri net area and enhance process algebras with stochastic timing. Approaches have been very recently published [11, 12, 13, 16]. In particular the European QMIPS project [15] investigates this idea. Approaches which introduce stochastic timing into process algebras are by no means identical. Especially the allowed distributions for activities differ. The use of generally distributed 1 times added to process algebras ....

[Article contains additional citation context not shown here]

N. Gotz, U. Herzog, M. Rettelbach; TIPP - Introduction and Application to Protocol Performance Analysis; in: Formale Beschreibungstechniken fur verteilte Systeme, FOKUS series (1993).

.... approaches can be studied (e.g. Stochastic Petri Net) our next purpose will be to replace deterministic duration values with probabilistic distribution duration functions, in order to provide a uniform integration of the theories of process algebras and performance evaluation (see, e.g. [7] for a preliminary study) This justifies the title of the paper. 4. In that paper, we also prove that if systems are time deterministic (there are no reachable states with two outgoing transitions labelled by the same action at the same time) then performance equivalence induces a semantics ....

N. Gotz, U. Herzog, M. Rettelbach, TIPP- Introduction and Application to Protocol Performance Analysis, in Proc. Performance '93, October 1993.

....affects the quality of the performance prediction for any model. This paper looks at two Markovian Process Algebras, TIPP and PEPA, and demonstrates how the adoption of nice synchronisation models affects the reliability of the resulting performance statistics. Stochastic Process Algebras [2, 3] are derived from standard process algebra models of CCS [4] and CSP [5] P : ff; f) P z action j (P P ) z choice j (P k s P ) z synchronisation j (P=L) z hiding j (A) z constant (1) The difference is that the standard non deterministic action ....

Norbert Gotz, Ulrich Herzog, and Michael Rettelbach. TIPP---Introduction and application to protocol performance analysis. In H Konig, editor, Formale Beschreibungstechniken fur verteilte Systeme, FOKUS. Saur-Verlag, Munich 1993.

....of a transition must be influenced by the one of all the transitions fired from states where it was enabled. Note that the influencing transitions turns out to be all concurrent with the considered one. This policy has been called enabling memory discipline in [1] It is also used in [19] by adding structure to the states of TIPP transition systems. Due to the enriched labels of proved transition systems, we need no modification of states that remain in a one to one correspondence with the states of the original calculus. Actually, our extension is downward compatible in the ....

....to reflect the speed of the slower partner. As usual, assume that parallel processes independently decide which actions fire. Therefore, the distribution of T is F T (x) P(T x) P(T 0 and T 1 lie in the interval (0;x] F T 0 (x) Delta F T 1 (x) This choice differs from PEPA [23] and TIPP [19], but it is in line with the approaches [4, 9] For instance, consider the process (a;F a ) j (a;F a ) where F a and F a are two stage Erlang distributions with parameters a = 1 and a = 2, respectively. Recall that a two stage Erlang distribution is a function F (t) 1 Gamma te Gammat ....

[Article contains additional citation context not shown here]

N. Gotz, U. Herzog, and M. Rettelbach. TIPP- introduction and application to protocol performance analysis. In Formale Beshreibungstechniken fur verteilte Systeme, FOKUS series, Saur publishers, Munic, 1993.

....exponential timing have been proposed recently as a good modelling paradigm to combine qualitative and quantitative analysis of complex parallel and concurrent systems. Several approaches to enhance untimed process algebras by exponentially distributed delays appeared in the literature (see [1, 5, 6, 8, 9, 13, 14]) All these approaches start from an untimed process algebra, extend the basic actions with exponential delays and generate an underlying CMTC. However, the concrete realisation of the approaches differs significantly. In this paper we introduce for a specific type of models described in ....

N. Gotz, U. Herzog, M. Rettelbach; TIPP - Introduction and application to protocol performance analysis; in: Formale Beschreibungstechniken fur verteilte Systeme, FOKUS series (1993).

....affects the quality of the performance prediction for any model. This paper looks at two Markovian Process Algebras, TIPP and PEPA, and demonstrates how the adoption of nice synchronisation models affects the reliability of the resulting performance statistics. Stochastic Process Algebras [7, 6] are derived from standard process algebra models of CCS [14] and CSP [12] P : ff; f) P z action j (P P ) z choice j (P k s P ) z synchronisation j (P=L) z hiding j (A) z constant (1) The difference is that the standard non deterministic ....

G otz, N., Herzog, U., and Rettelbach, M. TIPP---Introduction and application to protocol performance analysis. In Formale Beschreibungstechniken fur verteilte Systeme (Munich 1993), H. Konig, Ed., FOKUS, Saur-Verlag.

....introduced. Since a stochastic automaton can be executed using discrete event simulation techniques, the process algebra is called spades standing for stochastic process algebra for discrete event simulation, but we just write . Usually, the semantics of stochastic process algebras such as TIPP [11, 15], PEPA [16] and EMPA [4] is defined in terms of extended transition systems, which basically associate a distribution function to each transition. However, the inherent interleaving characteristic of transition systems demands a careful treatment of the definition of parallel composition. In ....

....general. To face this problem, the community has come up with different solutions. A first proposal, and the most widely accepted, has been to restrict the attention to exponential distributions. Their memoryless property restores the expansion law [16, 15, 4] Others have faced the general case [11, 13, 20] but the underlying semantic object usually becomes cumbersome and infinite, which makes it intractable. An alternative solution is to drop the expansion law by moving to true concurrency models [6] but for simple recursive processes, their semantic representations are infinite. We propose a more ....

[Article contains additional citation context not shown here]

N. Gotz, U. Herzog, and M.Rettelbach. TIPP - Introduction and application to protocol performance analysis. In H. Konig, ed., Formale Beschreibungstechniken fur verteilte Systeme, FOKUS series. Saur Publishers, 1993.

....for any model. This paper looks at two Markovian Process Algebras, TIPP and PEPA, and Submitted to PAPM 99. Obsoletes CSTR 98 009 demonstrates how the adoption of nice synchronisation models affects the reliability of the resulting performance statistics. Stochastic Process Algebras [8, 7] are derived from standard process algebra models of CCS [14] and CSP [13] P : ff; f) P z action j (P P ) z choice j (P k s P ) z synchronisation j (P=L) z hiding j (A) z constant (1) The difference is that the standard non deterministic action ....

G otz, N., Herzog, U., and Rettelbach, M. TIPP---Introduction and application to protocol performance analysis. In Formale Beschreibungstechniken fur verteilte Systeme (Munich 1993), H. Konig, Ed., FOKUS, Saur-Verlag.

....difficulty of the design and modelling of a system whose performance is studied rapidly grows with the size and complexity of the system itself. In the last few years, this phenomenon has drawn the attention of many researchers into extending process algebras with stochastic and real time features [15, 9, 11, 3, 6, 16]. Stochastic process algebras, as they are usually called, considerably simplify the tractability of complex systems because, in this framework, systems do not need to be modelled as a whole, but as a composition of small subsystems. Another advantage is that stochastic process algebras not only ....

....be equally expressive. In this way, the process algebra can be regarded as a language to describe stochastic automata. This result closely follows the methodology of [7] where a process calculus for timed automata was introduced. Usually, the semantics of stochastic process algebras such as TIPP [9, 13], PEPA [15] and EMPA [3] is defined in terms of extended transition systems, which, basically, have each transition labelled not only with the action name, but also with a distribution function that determines the timing of such a transition. But the inherent interleaving characteristic of ....

N. Gotz, U. Herzog, and M.Rettelbach. TIPP - Introduction and application to protocol performance analysis. In H. Konig, editor, Formale Beschreibungstechniken fur verteilte Systeme, FOKUS series. Saur Publishers, 1993.

....the property of partitioning the system state space. 82 2 A useful abstraction we gain from talking at the equivalence level at this stage is that it is independent of any particular specification methodology. Whether a system in specified in CCS [MIL80] or stochastically in PEPA [HIL94] or TIPP [GOT93], the arguments are equally applicable. 2.1 System Simplification One of the more useful properties that equivalences give us is that of system simplification. The amount of allowable variation in implementing or specifying a system (the design criteria) is modelled through the appropriate ....

Gotz, N., Herzog, U., Rettelbach, M., TIPP - Introduction and Application to Protocol Performance Analysis, Formale Beschreibungstechniken fur verteilte Systeme, Saur Publishing, 1993.

....difficulty of the design and modelling of a system whose performance is studied rapidly grows with the size and complexity of the system itself. In the last few years, this phenomenon has drawn the attention of many researchers into extending process algebras with stochastic and real time features [15, 9, 11, 3, 6, 16]. Stochastic process algebras, as they are usually called, considerably simplify the tractability of complex systems because, in this framework, systems do not need to be modelled as a whole, but as a composition of small subsystems. Another advantage is that stochastic process algebras not only ....

....be equally expressive. In this way, the process algebra can be regarded as a language to describe stochastic automata. This result closely follows the methodology of [7] where a process calculus for timed automata was introduced. Usually, the semantics of stochastic process algebras such as TIPP [9, 13], PEPA [15] and EMPA [3] is defined in terms of extended transition systems, which, basically, have each transition labelled not only with the action name, but also with a distribution function that determines the timing of such a transition. But the inherent interleaving characteristic of ....

N. Gotz, U. Herzog, and M.Rettelbach. TIPP - Introduction and application to protocol performance analysis. In H. Konig, editor, Formale Beschreibungstechniken fur verteilte Systeme, FOKUS series. Saur Publishers, 1993.

....any structure of communicating system. It is the goal of stochastic process algebras to inherit this descriptive power and additionally model the underlying stochastic process to derive performance and reliability information. This has been largely achieved with Markovian Process Algebras [13, 9, 1, 4] for Markovian systems. However, although extensions to Markovian Process Algebras have been produced [3, 20, 2] to model more general distributions, a Submitted to PAPM 99. completely general Stochastic Process Algebra is still elusive. This in turn is due to a distinct lack of tools and ....

....of compatibility. In the event that a process algebra were to use probabilistic choice then this would obviously have a much more straightforward conversion to the probabilistic branching model of the stochastic transition system. Although this stochastic mapping has been used before in TIPP [9], it is worth proving a couple of properties to justify its use. The first is an observational property: that is, that the total time that a process spends in a competitive choice should be distributed as the minimum of the two competing processes. The second is that of associativity and its ....

[Article contains additional citation context not shown here]

G otz, N., Herzog, U., and Rettelbach, M. TIPP---Introduction and application to protocol performance analysis. In Formale Beschreibungstechniken fur verteilte Systeme (Munich 1993), H. Konig, Ed., FOKUS, Saur-Verlag.

....In their approach non determinism gives rise to invalid simulations. This is a serious problem since an interleaving semantics is used, i.e. parallelism is resolved by non determinism. This artificial non determinism is absent in our non interleaving approach. Other proposals, like [32, 68] use decorated transition systems to define a non interleaving semantics. An approach that is quite close to ours is to use stochastic task graphs as a denotational model [41] Probabilistic process algebras Probabilistic process algebras have been studied quite extensively in the literature. ....

N. Gotz, U. Herzog and M. Rettelbach. TIPP -- Introduction and application to protocol performance analysis. In H. Konig, ed, Formale Beschreibungstechniken fur Verteilte Systeme. Saur publishers, 1993.

....of activities within the system. Stochastic process algebras present a different approach to the capturing of timing behaviour of systems: a duration is associated with each action. There are currently four published stochastic process algebras: TIPP, developed at the University of Erlangen [22, 21], PEPA, developed at the University of Edinburgh [36] MPA, developed at the University of Dortmund [9] and MPA, developed at the University of Bologna [4] In this paper we aim to stress the features which are common to all of them, with particular emphasis on TIPP and PEPA (for obvious ....

N. Gotz, U. Herzog, and M. Rettelbach. TIPP -- Introduction and Application to Protocol Performance Analysis. In H. Konig, editor, Formale Beschreibungstechniken fur verteilte Systeme. Saur Verlag, Reihe: FOKUS, 1993. 20

....convention that a certain random distribution function is associated with every action. Thus every action is represented as a pair consisting of an action name and the according random distribution function. Early work on TIPP has shown that it is in principle possible to use general distributions [7], but the advantages of the process algebra approach can only be integrated by a rather complex semantic treatment. Recent work is focusing on Markovian TIPP [6, 9] where only exponential distributions are allowed. This approach has also been developed by Hillston [12] and has recently been ....

N. Gotz, U. Herzog, and M. Rettelbach. TIPP --- introduction and application to protocol performance analysis. In Formale Beschreibungstechniken fur verteilte Systeme, Munich, 1993. FOKUS series, Saur publishers.

.... knowledge only two attempts have been made in the past in this direction [NY85, Zic87] However, the fascinating properties of process algebras are attracting more people now [Hil93, SH93] In the following sections we report on our research and experiences during the past [Her90b, Ret91, GHR92, GHR93] as well as on ongoing activities. 3.2 Stochastic Process Algebras The Concept The basic ideas of our concept are summarized in figure 3. We strictly follow the concept of classical process algebras describing the system behaviour by an abstract language (system description) with an underlying ....

....the behavioural information contained in the syntactic description. ffl For generally distributed time intervals we preserve this information by so called start reference ; they allow to solve the problem of residual time intervals in the case of parallel and competing process execution [Ret91, GHR93] ffl In case of exponentially distributed time intervals the Markovian property allows a drastic simplification. The structure of the semantic model corresponds to that of the standard Markov chain representation. Note, however, that the system designer does not see this more or less ....

[Article contains additional citation context not shown here]

Norbert Gotz, Ulrich Herzog, and Michael Rettelbach. TIPP --- introduction and application to protocol performance analysis. In Formale Beschreibungstechniken fur verteilte Systeme, Munich, to appear 1993. FOKUS series, Saur publishers.

....to CCS and LOTOS our calculus is enriched with stochastic timing information. In order to model the system s development through time every action prefix is accompanied with a parameter, characterising its duration. Early work on TIPP has shown that general distributions are in principle possible [7], nevertheless current work is focussing on Markovian TIPP where these random variables are assumed to be exponentially distributed. The semantic model is formally defined in a structural operational style introduced by Plotkin [20] The fact that like in every programming language it is ....

Norbert Gotz, Ulrich Herzog, and Michael Rettelbach. TIPP --- introduction and application to protocol performance analysis. In Formale Beschreibungstechniken fur verteilte Systeme, Munich, to appear 1993. FOKUS series, Saur publishers.

....lectures on classical process algebras and thrilled by the idea of systematic hierarchical modelling techniques, we started with a framework on Stochastic Process Algebras [24, 23] in the late eighties. We steadily extended our knowledge and got more and more involved in this exiting research area [38, 13, 12, 15, 11, 21]. Being sure that Stochastic Process Algebras offer some fundamental advantages, we have shown their basic ideas and concepts at many occasions, and have tried to demonstrate that this is an attractive alternative approach and a promising research area for many research groups. Today there is a ....

....experiences demonstrate that this approach Stochastic Process Algebras 11 is a suitable way to construct large system in an elegant way, under integral consideration of performance and dependability aspects. The case studies include data transfer with multiple send and wait communications [13] multiprocessor and task graph modelling [12] electronic mail system (with J. Hillston) 16] alternating bit protocol [20] robot control system (with S. Gilmore, J. Hillston and R. Holton) 10] multiprocessor mainframe with software failures [18] All these models were built up ....

N. Gotz, U. Herzog, and M. Rettelbach. TIPP -- Introduction and Application to Protocol Performance Analysis. In H. Konig, editor, Formale Beschreibungstechniken fur verteilte Systeme. Saur Verlag, Reihe: FOKUS, 1993.

....characteristic properties. Process algebras describe the functional behaviour of systems. 2 During several years of research, weshowedhow to combine both process algebras and stochastic processes. We demonstrated how to develop stochastic processalgebras with generally distributed time intervals [17, 18]. However, in order to present a complete theory and to evaluate the models efficiently, we had to restrict ourselves for the time being to Markovian process algebras. Markovian process algebras describe the timing behaviour by exponentially distributed time intervals (allowing phasetype ....

N. Gotz, U. Herzog, and M. Rettelbach. TIPP --- Introduction and Application to Protocol Performance Analysis. In Formale Beschreibungstechniken fur verteilte Systeme, Munich, 1993. FOKUS series, Saur publishers.

No context found.

G# otz, N., Herzog, U., and Rettelbach, M. TIPP---Introduction and application to protocol performance analysis. In Formale Beschreibungstechniken f#ur verteilte Systeme #Munich 1993#, H. K#onig, Ed., FOKUS, Saur-Verlag.

No context found.

N. Gotz, U. Herzog, and M.Rettelbach. TIPP - Introduction and application to protocol performance analysis. In H. Konig, ed., Formale Beschreibungstechniken fur verteilte Systeme, FOKUS series. Saur Publishers, 1993.

No context found.

N. GOTZ, U. HERZOG, and M. RETTELBACH, "TIPP - Introduction and Application to Protocol Performance Analysis," Technical Report, University of Erlangen, (March 1993).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC