Compositional performance modelling with the TIPPtool

Hermanns, Holger; Herzog, Ulrich; Klehmet, Ulrich; Mertsiotakis, Vassilis; Siegle, Markus

doi:10.1016/s0166-5316(99)00056-5

Cited by 56 publications

(10 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…RT-SPA model with finite state space the underlying Continuous Time Markov Chain (CTMC) can be translated into a associating state with each node of the Labeled Transition System (LTS) using simulation tool -TIPPtool [6,7]. The transitions of the CTMC are the amalgamation of all the arcs joining the nodes, and the Figure 2.…”

Section: Performance Analysis Methodsmentioning

confidence: 99%

Performance modelling and evaluation of OFDMA based WiMAX systems using RT-SPA

Tsang

2008

2008 International Conference on Computer and Communication Engineering

View full text Add to dashboard Cite

Multimedia stream service provided by broadband wireless networks has emerged as an important technology and has attracted much attention recently. An all-IP network architecture with reliable high-throughput air interface make orthogonal frequency division multiplexing access (OFDMA) based mobile worldwide interoperability for microwave access (mobile WiMAX) a viable technology for wireless multimedia services, such as voice over IP (VoIP), mobile TV, and so on. In this article, we first give an overview of the key aspects of WiMAX and describe multimedia broadcast multicast service (MBMS) architecture of the 3GPP. We propose a framework for combined real-time behaviors and stochastic process algebra. This is done with a modeling language, called Real-Time Stochastic Process Algebra (RT-SPA), for describing the real-time stochastic behaviors of wireless networks. This methodology can then be analyzed using an automatic tool. With this performance analysis methodology it is possible to obtain the design parameters of implementation using simulation with a lower computational time and cost.

show abstract

Section: Performance Analysis Methodsmentioning

confidence: 99%

Performance modelling and evaluation of OFDMA based WiMAX systems using RT-SPA

Tsang

2008

2008 International Conference on Computer and Communication Engineering

View full text Add to dashboard Cite

show abstract

“…Strong and observational bisimulations were implemented using the Kanellakis-Smolka algorithm, but an export to CADP's AUT format was also available; the Baier algorithm was used for Markovian bisimulations; symbolic algorithms based on BDDs were also developed for this purpose [235] [236]. Various systems have been analyzed using TIPPtool, e.g., an alternating bit protocol [231], a communication protocol [162], a plain-old telephone system (tackled using TIPPtool in combination with CADP) [229], and an hospital communication system [225].…”

Section: Bisimulation Tools For Probabilistic and Stochastic Systemsmentioning

confidence: 99%

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

Garavel

Lang

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Equivalence checking is a formal verification approach that consists in proving that two programs or models are related modulo some equivalence relation, or that one is included in the other modulo some preorder relation. In the case of concurrent systems, which are often represented using labelled transition systems, the relations used for equivalence checking are bisimulations and their simulation preorders. In the case of probabilistic or stochastic systems, which are usually represented using Markov chains, the relations used for equivalence checking are lumpability, probabilistic and stochastic equivalences, and their associated preorders. The present article provides a synthetic overview of 40 years of research in the design of algorithms and software tools for equivalence checking.

show abstract

“…Research in the modelling and evaluation of system performance has primarily focussed on process algebra such as PEPA [11] and TIPP [10] and Stochastic Petri nets [17]. These approaches allow specification of delays, which are realised by exponential distributions in a Markov Process simulation.…”

Section: Comparisons With Other Work and Research Directionsmentioning

confidence: 99%

Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems

McIver

2006

FM 2006: Formal Methods

View full text Add to dashboard Cite

For standard (ie non-probabilistic) systems of reasonable size, correctness is analysed by simulation and/or model checking, possibly with standard program-logical arguments beforehand to reduce the problem size by abstraction. For probabilistic systems there are model checkers and simulators too; but probabilistic program logics are rarer. Thus e.g. model checkers face more severe exposure to state explosion because "front-end" probabilistic abstraction techniques are not so widely known [20]. We formalise probabilistic refinement of action systems [3] in order to provide just such a front end, and we illustrate with the probabilistic model checker PRISM [24] how it can be used to reduce state explosion. The case study is based on a performance analysis of randomised backoff in wireless communication [1].

show abstract

Compositional performance modelling with the TIPPtool

Cited by 56 publications

References 34 publications

Performance modelling and evaluation of OFDMA based WiMAX systems using RT-SPA

Performance modelling and evaluation of OFDMA based WiMAX systems using RT-SPA

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems

Contact Info

Product

Resources

About