Results 1  10
of
99
The Möbius Framework and Its Implementation
"... The Möbius framework is an environment for supporting multiple modeling formalisms and solution techniques. Models expressed in formalisms that are compatible with the framework are translated into equivalent models using Mobius framework components. This translation preserves the structure of the m ..."
Abstract

Cited by 113 (21 self)
 Add to MetaCart
(Show Context)
The Möbius framework is an environment for supporting multiple modeling formalisms and solution techniques. Models expressed in formalisms that are compatible with the framework are translated into equivalent models using Mobius framework components. This translation preserves the structure of the models, allowing e#cient solutions. The framework is implemented in the tool by a welldefined abstract functional interface. Models and solution techniques interact with one another through the use of the standard interface, allowing them to interact with Mobius framework components, not formalism components. This permits novel combinations of modeling techniques, and will be a catalyst for new research in modeling techniques. This paper describes our approach, focusing on the "atomic model." We describe the formal description of the Mobius components as well as their implementations in our software tool.
An Efficient Algorithm for Aggregating PEPA Models
 IEEE Transactions on Software Engineering
, 1999
"... Performance Evaluation Process Algebra (PEPA) is a formal language for performance modelling based on process algebra. It has previously been shown that using the process algebra apparatus compact performance models can be derived which retain the essential behavioural characteristics of the modelle ..."
Abstract

Cited by 63 (30 self)
 Add to MetaCart
Performance Evaluation Process Algebra (PEPA) is a formal language for performance modelling based on process algebra. It has previously been shown that using the process algebra apparatus compact performance models can be derived which retain the essential behavioural characteristics of the modelled system. However no efficient algorithm for this derivation was given. In this paper we present an efficient algorithm which recognises and takes advantage of symmetries within the model and avoids unnecessary computation. The algorithm is illustrated by a multiprocessor example. Keywords: Performance modelling, model aggregation, performance evaluation tools, stochastic process algebras. 1 Introduction In recent years several Markovian process algebras (MPAs) have been presented in the literature. These include PEPA [1], MTIPP [2], and EMPA [3]. As with classical process algebras, these formalisms allow models of systems to be constructed which are amenable to functional or behavioural an...
A toolbox for functional and quantitative analysis of DEDS
 Proc. 10th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, Lecture Notes in Computer Science 1469
, 1998
"... Abstract This paper presents a toolbox for the construction of modular tools for functional and quantitative (performance) analysis of discrete event dynamic systems (DEDS). The intention is to simplify the usage of appropriate analysis algorithms, thus supporting the development of appropriate tool ..."
Abstract

Cited by 33 (15 self)
 Add to MetaCart
(Show Context)
Abstract This paper presents a toolbox for the construction of modular tools for functional and quantitative (performance) analysis of discrete event dynamic systems (DEDS). The intention is to simplify the usage of appropriate analysis algorithms, thus supporting the development of appropriate tools.
Automated performance and dependability evaluation using model checking
 In Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
, 2002
"... Abstract. Markov chains (and their extensions with rewards) have been widely used to determine performance, dependability and performability characteristics of computer communication systems, such as throughput, delay, mean time to failure, or the probability to accumulate at least a certain amount ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Markov chains (and their extensions with rewards) have been widely used to determine performance, dependability and performability characteristics of computer communication systems, such as throughput, delay, mean time to failure, or the probability to accumulate at least a certain amount of reward in a given time. Due to the rapidly increasing size and complexity of systems, Markov chains and Markov reward models are difficult and cumbersome to specify by hand at the statespace level. Therefore, various specification formalisms, such as stochastic Petri nets and stochastic process algebras, have been developed to facilitate the specification of these models at a higher level of abstraction. Uptill now, however, the specification of the measureofinterest is often done in an informal and relatively unstructured way. Furthermore, some measuresofinterest can not be expressed conveniently at all. In this tutorial paper, we present a logicbased specification technique to specify performance, dependability and performability measuresofinterest and show how for a given finite Markov chain (or Markov reward model) such measures can be evaluated in a fully automated way. Particular emphasis will be given to socalled pathbased measures and hierarchicallyspecified measures. For this purpose, we extend socalled model checking techniques to reason about discrete and continuoustime Markov chains and their rewards. We also report on the use of techniques such as (compositional) model reduction and measuredriven statespace generation to combat the infamous state space explosion problem. 1
The GreatSPN tool: recent enhancements
 SIGMETRICS Performance Evaluation Review, Special Issue on Tools for Performance Evaluation
"... GreatSPN is a tool that supports the design and the qualitative and quantitative analysis of Generalized Stochastic Petri Nets (GSPN) and of Stochastic WellFormed Nets (SWN). The very first version of GreatSPN saw the light in the late eighties of last century: since then two main releases where ..."
Abstract

Cited by 17 (9 self)
 Add to MetaCart
(Show Context)
GreatSPN is a tool that supports the design and the qualitative and quantitative analysis of Generalized Stochastic Petri Nets (GSPN) and of Stochastic WellFormed Nets (SWN). The very first version of GreatSPN saw the light in the late eighties of last century: since then two main releases where developed and widely distributed to the research community: GreatSPN1.7 [12], and GreatSPN2.0 [7]. This paper reviews the main functionalities of GreatSPN2.0 and presents some recently added features that significantly enhance the efficacy of the tool. 1.
Model Checking Medium Access Control for Sensor Networks
"... Abstract — We describe verification of SMAC, a medium access control protocol designed for wireless sensor networks, by means of the PRISM model checker. The SMAC protocol is built on top of the IEEE 802.11 standard for wireless ad hoc networks and, as such, it uses the same randomised backoff pro ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
Abstract — We describe verification of SMAC, a medium access control protocol designed for wireless sensor networks, by means of the PRISM model checker. The SMAC protocol is built on top of the IEEE 802.11 standard for wireless ad hoc networks and, as such, it uses the same randomised backoff procedure as a means to avoid collision. In order to minimise energy consumption, in SMAC, nodes are periodically put into a sleep state. Synchronisation of the sleeping schedules is necessary for the nodes to be able to communicate. Intuitively, energy saving obtained through a periodic sleep mechanism will be at the expense of performance. In previous work on SMAC verification [25], a combination of analytical techniques and simulation has been used to confirm the correctness of this intuition for a simplified (abstract) version of the protocol in which the initial schedules coordination phase is assumed correct. We show how we have used the PRISM model checker to verify the behaviour of SMAC and compare it to that of IEEE 802.11.
Attacking Symbolic State Explosion
"... We propose a new symbolic model checking algorithm for parameterized concurrent systems modeled as (Lossy) Petri Nets, and (Lossy) Vector Addition Systems, based on the following ingredients: a rich assertional language based on the graphbased symbolic representation of upwardclosed sets introduce ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
We propose a new symbolic model checking algorithm for parameterized concurrent systems modeled as (Lossy) Petri Nets, and (Lossy) Vector Addition Systems, based on the following ingredients: a rich assertional language based on the graphbased symbolic representation of upwardclosed sets introduced in [DR00], the combination of the backward reachability algorithm of [ACJT96] lifted to the symbolic setting with a new heuristic rule based on structural properties of Petri Nets. We evaluate the method on several Petri Nets and parameterized systems taken from the literature [ABC95, EM00, Fin93, MC99], and we compare the results with other finite and infinitestate verification tools.
On the Aggregation Techniques in Stochastic Petri Nets and Stochastic Process Algebras
 Proceedings of the Third International Workshop on Process Algebras and Performance Modelling
, 1995
"... this paper. 1. INTRODUCTION ..."
(Show Context)
Parametric fault tree for the dependability analysis of redundant systems and its highlevel petri net semantics
 IEEE Transactions on Software Engineering
, 2003
"... Abstract—In order to cope efficiently with the dependability analysis of redundant systems with replicated units, a new, more compact faulttree formalism, called Parametric Fault Tree (PFT), is defined. In a PFT formalism, replicated units are folded and indexed so that only one representative of t ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
(Show Context)
Abstract—In order to cope efficiently with the dependability analysis of redundant systems with replicated units, a new, more compact faulttree formalism, called Parametric Fault Tree (PFT), is defined. In a PFT formalism, replicated units are folded and indexed so that only one representative of the similar replicas is included in the model. From the PFT, a list of parametric cut sets can be derived, where only the relevant patterns leading to the system failure are evidenced regardless of the actual identity of the component in the cut set. The paper provides an algorithm to convert a PFT into a class of HighLevel Petri Nets, called SWN. The purpose of this conversion is twofold: to exploit the modeling power and flexibility of the SWN formalism, allowing the analyst to include statistical dependencies that could not have been accommodated into the corresponding PFT; to exploit the capability of the SWN formalism to generate a lumped Markov chain, thus alleviating the state explosion problem. The search for the minimal cut sets (qualitative analysis) can be often performed by a structural Tinvariant analysis on the generated SWN. The advantages that can be obtained from the translation of a PFT into a SWN are investigated considering a faulttolerant multiprocessor system example. Index Terms—Dependability analysis, parametric fault tree, stochastic wellformed nets. 1