576 research outputs found
Experiences with the PEPA performance modelling tools
The PEPA language [1] is supported by a suite of modelling tools which assist in the solution and analysis of PEPA models. The design and development of these tools have been influenced by a variety of factors, including the wishes of other users of the tools to use the language for purposes which were not anticipated by the tool designers. In consequence, the suite of PEPA tools has adapted to attempt to serve the needs of these users while continuing to support the language designers themselves. In this paper we report on our use of the PEPA tools and give some advice gained from our experiences.
An Aggregation Technique for Large-Scale PEPA Models with Non-Uniform Populations
Performance analysis based on modelling consists of two major steps: model
construction and model analysis. Formal modelling techniques significantly aid
model construction but can exacerbate model analysis. In particular, here we
consider the analysis of large-scale systems which consist of one or more
entities replicated many times to form large populations. The replication of
entities in such models can cause their state spaces to grow exponentially to
the extent that their exact stochastic analysis becomes computationally
expensive or even infeasible.
In this paper, we propose a new approximate aggregation algorithm for a class
of large-scale PEPA models. For a given model, the method quickly checks if it
satisfies a syntactic condition, indicating that the model may be solved
approximately with high accuracy. If so, an aggregated CTMC is generated
directly from the model description. This CTMC can be used for efficient
derivation of an approximate marginal probability distribution over some of the
model's populations. In the context of a large-scale client-server system, we
demonstrate the usefulness of our method
Process algebra for performance evaluation
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined by a random variable. A huge class of resource-sharing systems – like large-scale computers, client–server architectures, networks – can accurately be described using such stochastic specification formalisms. The main emphasis of this paper is the treatment of operational semantics, notions of equivalence, and (sound and complete) axiomatisations of these equivalences for different types of Markovian process algebras, where delays are governed by exponential distributions. Starting from a simple actionless algebra for describing time-homogeneous continuous-time Markov chains, we consider the integration of actions and random delays both as a single entity (like in known Markovian process algebras like TIPP, PEPA and EMPA) and as separate entities (like in the timed process algebras timed CSP and TCCS). In total we consider four related calculi and investigate their relationship to existing Markovian process algebras. We also briefly indicate how one can profit from the separation of time and actions when incorporating more general, non-Markovian distributions
Proceedings of International Workshop "Global Computing: Programming Environments, Languages, Security and Analysis of Systems"
According to the IST/ FET proactive initiative on GLOBAL COMPUTING, the goal is to obtain techniques (models, frameworks, methods, algorithms) for constructing systems that are flexible, dependable, secure, robust and efficient.
The dominant concerns are not those of representing and manipulating data efficiently but rather those of handling the co-ordination and interaction, security, reliability, robustness, failure modes, and control of risk of the entities in the system and the overall design, description and performance of the system itself.
Completely different paradigms of computer science may have to be developed to tackle these issues effectively. The research should concentrate on systems having the following characteristics: • The systems are composed of autonomous computational entities where activity is not centrally controlled, either because global control is impossible or impractical, or because the entities are created or controlled by different owners.
• The computational entities are mobile, due to the movement of the physical platforms or by movement of the entity from one platform to another.
• The configuration varies over time. For instance, the system is open to the introduction of new computational entities and likewise their deletion.
The behaviour of the entities may vary over time.
• The systems operate with incomplete information about the environment.
For instance, information becomes rapidly out of date and mobility requires information about the environment to be discovered.
The ultimate goal of the research action is to provide a solid scientific foundation for the design of such systems, and to lay the groundwork for achieving effective principles for building and analysing such systems.
This workshop covers the aspects related to languages and programming environments as well as analysis of systems and resources involving 9 projects (AGILE , DART, DEGAS , MIKADO, MRG, MYTHS, PEPITO, PROFUNDIS, SECURE) out of the 13 founded under the initiative. After an year from the start of the projects, the goal of the workshop is to fix the state of the art on the topics covered by the two clusters related to programming environments and analysis of systems as well as to devise strategies and new ideas to profitably continue the research effort towards the overall objective of the initiative.
We acknowledge the Dipartimento di Informatica and Tlc of the University of Trento, the Comune di Rovereto, the project DEGAS for partially funding the event and the Events and Meetings Office of the University of Trento for the valuable collaboration
Stochastic Modelling and Analysis of Driver Behaviour
Driver behaviour is considered a key factor in the majority of car accidents. As a consequence driver behaviour has been receiving vast attention in different domain areas, such as psychology, transport engineering and computer science. Computer scientists are primarily interested in what and how computing means can be applied to understand the relation between driver behaviour and transport systems. In this paper, we adopt a stochastic approach to conduct a quantitative investigation of driver behaviour. We use the Markovian process algebra PEPA (Performance Evaluation Process Algebra) to describe the overall system model. The system component describing the topology and dynamic of the traffic is composed in parallel with the system component describing the driver state and its evolution due to experience. We illustrate our approach using a three-way junction as an example and present the numerical results of the system analysis
Derivation of passage-time densities in PEPA models using ipc: the imperial PEPA compiler
We present a technique for defining and extracting passage-time densities from high-level stochastic process algebra models. Our high-level formalism is PEPA, a popular Markovian process algebra for expressing compositional performance models. We introduce ipc, a tool which can process PEPA-specified passage-time densities and models by compiling the PEPA model and passage specification into the DNAmaca formalism. DNAmaca is an established modelling language for the low-level specification of very large Markov and semi-Markov chains. We provide performance results for ipc/DNAmaca and comparisons with another tool which supports PEPA, PRISM. Finally, we generate passage-time densities and quantiles for a case study of a high-availability web server. 1
Patch-based Hybrid Modelling of Spatially Distributed Systems by Using Stochastic HYPE - ZebraNet as an Example
Individual-based hybrid modelling of spatially distributed systems is usually
expensive. Here, we consider a hybrid system in which mobile agents spread over
the space and interact with each other when in close proximity. An
individual-based model for this system needs to capture the spatial attributes
of every agent and monitor the interaction between each pair of them. As a
result, the cost of simulating this model grows exponentially as the number of
agents increases. For this reason, a patch-based model with more abstraction
but better scalability is advantageous. In a patch-based model, instead of
representing each agent separately, we model the agents in a patch as an
aggregation. This property significantly enhances the scalability of the model.
In this paper, we convert an individual-based model for a spatially distributed
network system for wild-life monitoring, ZebraNet, to a patch-based stochastic
HYPE model with accurate performance evaluation. We show the ease and
expressiveness of stochastic HYPE for patch-based modelling of hybrid systems.
Moreover, a mean-field analytical model is proposed as the fluid flow
approximation of the stochastic HYPE model, which can be used to investigate
the average behaviour of the modelled system over an infinite number of
simulation runs of the stochastic HYPE model.Comment: In Proceedings QAPL 2014, arXiv:1406.156
06161 Abstracts Collection -- Simulation and Verification of Dynamic Systems
From 17.04.06 to 22.04.06, the Dagstuhl Seminar 06161 ``Simulation and Verification of Dynamic Systems\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
- …