Search

Your search keyword '"Tribastone, Mirco"' showing total 368 results
Start Over Author "Tribastone, Mirco"

Refine your results

more »

more »

more »

more »
368 results on '"Tribastone, Mirco"'

201. Symbolic Semantics for Probabilistic Programs

Author

Voogd, Erik, Johnsen, Einar Broch, Silva, Alexandra, Susag, Zachary J., Wąsowski, Andrzej, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

202. Matching Distributions Under Structural Constraints

Author

Bies, Aaron, Hermanns, Holger, Köhl, Maximilian A., Schmidt, Andreas, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

205. Deductive Controller Synthesis for Probabilistic Hyperproperties

Author

Andriushchenko, Roman, Bartocci, Ezio, Češka, Milan, Pontiggia, Francesco, Sallinger, Sarah, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

206. An MM Algorithm to Estimate Parameters in Continuous-Time Markov Chains

Author

Bacci, Giovanni, Ingólfsdóttir, Anna, Larsen, Kim G., Reynouard, Raphaël, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

207. Introducing Asynchronicity to Probabilistic Hyperproperties

Author

Gerlach, Lina, Dobe, Oyendrila, Ábrahám, Erika, Bartocci, Ezio, Bonakdarpour, Borzoo, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

208. Verification of Quantum Systems Using Barrier Certificates

Author

Lewis, Marco, Zuliani, Paolo, Soudjani, Sadegh, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

211. Jajapy: A Learning Library for Stochastic Models

Author

Reynouard, Raphaël, Ingólfsdóttir, Anna, Bacci, Giovanni, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

212. On the Trade-Off Between Efficiency and Precision of Neural Abstraction

Author

Edwards, Alec, Giacobbe, Mirco, Abate, Alessandro, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

214. Model Abstraction and Conditional Sampling with Score-Based Diffusion Models

Author

Bortolussi, Luca, Cairoli, Francesca, Giacomarra, Francesco, Scassola, Davide, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

217. Analysis of an Epoch Commit Protocol for Distributed Processing Systems

Author

Ezhilchelvan, Paul, Mitrani, Isi, Webber, Jim, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

218. Comparing Two Approaches to Include Stochasticity in Hybrid Automata

Author

Willemsen, Lisa, Remke, Anne, Ábrahám, Erika, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

219. Equilibrium Analysis of Markov Regenerative Processes

Author

Horváth, András, Paolieri, Marco, Vicario, Enrico, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jansen, Nils, editor, and Tribastone, Mirco, editor

Published
2023
Full Text
View/download PDF

221. <P style="TEXT-ALIGN: left; MARGIN-TOP: 0px; MARGIN-BOTTOM: 0px; MARGIN-LEFT: 2px" class=mediumb-text>Modular performance modelling for mobile applications

Author

Arijo, Niaz, Heckel, Reiko, Tribastone, Mirco, and Gilmore, Stephen

Abstract

We propose a model-based approach to analysing the performance of mobile applications where physical mobility and state changes are modelled by graph transformations from which a model in the Performance Evaluation Process Algebra (PEPA) is derived. To fight scalability problems with state space generation we adopt a modular solution where the graph transformation system is decomposed into views, for which labelled transition systems (LTS) are generated separately and later synchronised in PEPA. We demonstrate that the result of this modular analysis is equivalent to that of the monolithic approach and evaluate practicality and scalability by means of a case study.

Published
2011
Full Text
View/download PDF

222. PID Control of Biochemical Reaction Networks.

Author

Whitby, Max, Cardelli, Luca, Kwiatkowska, Marta, Laurenti, Luca, Tribastone, Mirco, and Tschaikowski, Max

Subjects
*SINGULAR perturbations, *CHEMICAL process control, *BIOLOGICAL systems, *PERTURBATION theory, *GENETIC models
Abstract

Principles of feedback control have been shown to naturally arise in biological systems and have been applied with success to build synthetic circuits. Here, we present an implementation of a proportional–integral–derivative (PID) controller as a chemical reaction network with mass-action kinetics. This makes the controller synthesizable in vitro using DNA strand displacement technology, owing to its demonstrated capability of realizing arbitrary reaction-network designs as interacting DNA molecules. Previous related work has studied biological PID architectures using linearizations of nonlinear dynamics arising in both the controller components and in the plant. In this article, we present a proof of correctness of our nonlinear design in closed loop using arguments from singular perturbation theory. As an application to show the effectiveness of our controller, we provide numerical simulations on a genetic model to perform PID feedback control of protein expression. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

223. CLUE: exact maximal reduction of kinetic models by constrained lumping of differential equations.

Author

Ovchinnikov, Alexey, Verona, Isabel Pérez, Pogudin, Gleb, and Tribastone, Mirco

Subjects
*LOTKA-Volterra equations, *DIFFERENTIAL equations, *LINEAR differential equations, *NONLINEAR differential equations, *ALGORITHMS, *LINEAR algebra
Abstract

Motivation Detailed mechanistic models of biological processes can pose significant challenges for analysis and parameter estimations due to the large number of equations used to track the dynamics of all distinct configurations in which each involved biochemical species can be found. Model reduction can help tame such complexity by providing a lower-dimensional model in which each macro-variable can be directly related to the original variables. Results We present CLUE, an algorithm for exact model reduction of systems of polynomial differential equations by constrained linear lumping. It computes the smallest dimensional reduction as a linear mapping of the state space such that the reduced model preserves the dynamics of user-specified linear combinations of the original variables. Even though CLUE works with non-linear differential equations, it is based on linear algebra tools, which makes it applicable to high-dimensional models. Using case studies from the literature, we show how CLUE can substantially lower model dimensionality and help extract biologically intelligible insights from the reduction. Availability and implementation An implementation of the algorithm and relevant resources to replicate the experiments herein reported are freely available for download at https://github.com/pogudingleb/CLUE. Supplementary information Supplementary data are available at Bioinformatics online. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

224. On the (Page) Ranking of Professional Tennis Players

Author

Dingle, Nicholas, Knottenbelt, William, Spanias, Demetris, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

225. Energy Consumption in the Office

Author

Stefanek, Anton, Harder, Uli, Bradley, Jeremy T., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

226. Performance Modelling of Magnetohydrodynamics Codes

Author

Bird, R. F., Wright, S. A., Beckingsale, D. A., Jarvis, S. A., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

227. Towards a Volunteer Cloud Architecture

Author

Alwabel, Abdulelah, Walters, Robert, Wills, Gary, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

228. Don’t Just Go with the Flow: Cautionary Tales of Fluid Flow Approximation

Author

Pourranjbar, Alireza, Hillston, Jane, Bortolussi, Luca, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

229. Optimisation of Patch Distribution Strategies for AMR Applications

Author

Beckingsale, D. A., Perks, O. F. J., Gaudin, W. P., Herdman, J. A., Jarvis, S. A., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

230. A Novel Approach to Energy Efficient Content Distribution with BitTorrent

Author

Forshaw, Matthew, Thomas, Nigel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

231. PCTMC Models of Wireless Sensor Network Protocols

Author

Guenther, Marcel C., Bradley, Jeremy T., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

232. A Path Connection Availability Model for MANETs with Random Waypoint Mobility

Author

Younes, Osama, Thomas, Nigel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

233. Formal Performance Modelling: From Protocols to People

Author

Thomas, Nigel, Harrison, Michael, Zhao, Yishi, Chen, Xiao, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

234. Compositional Approximate Markov Chain Aggregation for PEPA Models

Author

Milios, Dimitrios, Gilmore, Stephen, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

235. Tradeoff between Accuracy and Efficiency in the Time-Parallel Simulation of Monotone Systems

Author

Fourneau, J. M., Quessette, F., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

236. SRN Models for Analysis of Multihop Wireless Ad Hoc Networks

Author

Younes, Osama, Thomas, Nigel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

237. Experimental Evaluation of the Performance-Influencing Factors of Virtualized Storage Systems

Author

Noorshams, Qais, Kounev, Samuel, Reussner, Ralf, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

238. Moment Closures for Performance Models with Highly Non-linear Rates

Author

Guenther, Marcel C., Stefanek, Anton, Bradley, Jeremy T., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

239. Scale-Freeness of SPA Models with Weighted Immediate Actions

Author

Schuster, Johann, Siegle, Markus, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

240. Operational Semantics for Product-Form Solution

Author

Vigliotti, Maria Grazia, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

241. Trading Power Consumption against Performance by Reserving Blocks of Servers

Author

Mitrani, Isi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tribastone, Mirco, editor, and Gilmore, Stephen, editor

Published
2013
Full Text
View/download PDF

242. Non-functional properties in the model-driven development of service-oriented systems.

Author

Gilmore, Stephen, Gönczy, László, Koch, Nora, Mayer, Philip, Tribastone, Mirco, and Varró, Dániel

Subjects
*SERVICE-oriented architecture (Computer science), *COMPUTER software development, *COMPUTER software, *COMPUTER software industry, *COMPUTER service industry
Abstract

Systems based on the service-oriented architecture (SOA) principles have become an important cornerstone of the development of enterprise-scale software applications. They are characterized by separating functions into distinct software units, called services, which can be published, requested and dynamically combined in the production of business applications. Service-oriented systems (SOSs) promise high flexibility, improved maintainability, and simple re-use of functionality. Achieving these properties requires an understanding not only of the individual artifacts of the system but also their integration. In this context, non-functional aspects play an important role and should be analyzed and modeled as early as possible in the development cycle. In this paper, we discuss modeling of non-functional aspects of service-oriented systems, and the use of these models for analysis and deployment. Our contribution in this paper is threefold. First, we show how services and service compositions may be modeled in UML by using a profile for SOA (UML4SOA) and how non-functional properties of service-oriented systems can be represented using the non-functional extension of UML4SOA (UML4SOA-NFP) and the MARTE profile. This enables modeling of performance, security and reliable messaging. Second, we discuss formal analysis of models which respect this design, in particular we consider performance estimates and reliability analysis using the stochastically timed process algebra PEPA as the underlying analytical engine. Last but not least, our models are the source for the application of deployment mechanisms which comprise model-to-model and model-to-text transformations implemented in the framework VIATRA. All techniques presented in this work are illustrated by a running example from an eUniversity case study. [ABSTRACT FROM AUTHOR]

Published
2011
Full Text
View/download PDF

243. Limit Your Consumption! Finding Bounds in Average-energy Games

Author

Martin Zimmermann, Kim Guldstrand Larsen, Simon Laursen, Tribastone, Mirco, and Wiklicky, Herbert

Subjects
Consumption (economics), FOS: Computer and information sciences, Mathematical optimization, Existential quantification, lcsh:Mathematics, 020208 electrical & electronic engineering, 020207 software engineering, 02 engineering and technology, lcsh:QA1-939, Upper and lower bounds, lcsh:QA75.5-76.95, Exponential function, Computer Science - Computer Science and Game Theory, Bounding overwatch, 0202 electrical engineering, electronic engineering, information engineering, Limit (mathematics), lcsh:Electronic computers. Computer science, Time complexity, Energy (signal processing), Mathematics, Computer Science and Game Theory (cs.GT)
Abstract

Energy games are infinite two-player games played in weighted arenas with quantitative objectives that restrict the consumption of a resource modeled by the weights, e.g., a battery that is charged and drained. Typically, upper and/or lower bounds on the battery capacity are part of the problem description. Here, we consider the problem of determining upper bounds on the average accumulated energy or on the capacity while satisfying a given lower bound, i.e., we do not determine whether a given bound is sufficient to meet the specification, but if there exists a sufficient bound to meet it. In the classical setting with positive and negative weights, we show that the problem of determining the existence of a sufficient bound on the long-run average accumulated energy can be solved in doubly-exponential time. Then, we consider recharge games: here, all weights are negative, but there are recharge edges that recharge the energy to some fixed capacity. We show that bounding the long-run average energy in such games is complete for exponential time. Then, we consider the existential version of the problem, which turns out to be solvable in polynomial time: here, we ask whether there is a recharge capacity that allows the system player to win the game. We conclude by studying tradeoffs between the memory needed to implement strategies and the bounds they realize. We give an example showing that memory can be traded for bounds and vice versa. Also, we show that increasing the capacity allows to lower the average accumulated energy., Comment: In Proceedings QAPL'16, arXiv:1610.07696

Published
2016

244. Size expansions of mean field approximation: Transient and steady-state analysis

Author

GastNicolas, TribastoneMirco, BortolussiLuca, aavv, Gast, Nicola, Bortolussi, Luca, Tribastone, Mirco, Performance analysis and optimization of LARge Infrastructures and Systems (POLARIS ), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Università degli studi di Trieste, IMT Institute for Advanced Studies [Lucca], and Università degli studi di Trieste = University of Trieste

Subjects
Computer science, Computer Networks and Communications, media_common.quotation_subject, Steady State Analysis, 02 engineering and technology, 01 natural sciences, 010104 statistics & probability, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Size expansion, Mean Field Analysis, Transient Analysi, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, [MATH]Mathematics [math], Transient Analysis, media_common, Mathematical analysis, 020206 networking & telecommunications, Infinity, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], Mean field theory, Hardware and Architecture, Modeling and Simulation, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Software, Mean Field Analysi
Abstract

International audience; Mean field approximation is a powerful tool to study the performance of large stochastic systems that is known to be exact as the system's size N goes to infinity. Recently, it has been shown that, when one wants to compute expected performance metric in steady-state, this approximation can be made more accurate by adding a term V /N to the original approximation. This is called a refined mean field approximation in [21]. In this paper, we improve this result in two directions. First, we show how to obtain the same result for the transient regime. Second, we provide a further refinement by expanding the term in 1/N 2 (both for transient and steady-state regime). Our derivations are inspired by moment-closure approximation, a popular technique in theoretical biochemistry. We provide a number of examples that show: (1) that this new approximation is usable in practice for systems with up to a few tens of dimensions, and (2) that it accurately captures the transient and steady state behavior of such systems.

Published
2019

245. CARMA: Collective Adaptive Resource-sharing Markovian Agents

Author

Luca Bortolussi, Rocco De Nicola, Vashti Galpin, Mieke Massink, Stephen Gilmore, Diego Latella, Jane Hillston, Michele Loreti, Bertrand, Nathalie, Tribastone, Mirco, Bortolussi, Luca, De Nicola, Rocco, Galpin, Vashti, Gilmore, Stephen, Hillston, Jane, Latella, Diego, Loreti, Michele, and Massink, Mieke

Subjects
FOS: Computer and information sciences, B.8.2, Theoretical computer science, Mathematical Logic and Formal Languages, C.4, Computer science, 0211 other engineering and technologies, Markov process, 02 engineering and technology, Stochastic Process Algebras, Attribute-based Process Algebras, lcsh:QA75.5-76.95, Set (abstract data type), symbols.namesake, Simple (abstract algebra), Adaptive system, 0202 electrical engineering, electronic engineering, information engineering, Collective Adaptive Systems, Class (computer programming), Computer Science - Programming Languages, Computer Science - Performance, 021103 operations research, Multicast, lcsh:Mathematics, Quantitative Modelling and Analysis of Systems, lcsh:QA1-939, Models and Principles, Shared resource, Performance (cs.PF), Computer Science - Distributed, Parallel, and Cluster Computing, Collective adaptive systems, Calculi for Collective Adaptive System Computing, symbols, 020201 artificial intelligence & image processing, Distributed, Parallel, and Cluster Computing (cs.DC), lcsh:Electronic computers. Computer science, Collective Adaptive System, Programming Languages (cs.PL)
Abstract

In this paper we present CARMA, a language recently defined to support specification and analysis of collective adaptive systems. CARMA is a stochastic process algebra equipped with linguistic constructs specifically developed for modelling and programming systems that can operate in open-ended and unpredictable environments. This class of systems is typically composed of a huge number of interacting agents that dynamically adjust and combine their behaviour to achieve specific goals. A CARMA model, termed a collective, consists of a set of components, each of which exhibits a set of attributes. To model dynamic aggregations, which are sometimes referred to as ensembles, CARMA provides communication primitives that are based on predicates over the exhibited attributes. These predicates are used to select the participants in a communication. Two communication mechanisms are provided in the CARMA language: multicast-based and unicast-based. In this paper, we first introduce the basic principles of CARMA and then we show how our language can be used to support specification with a simple but illustrative example of a socio-technical collective adaptive system., Comment: In Proceedings QAPL 2015, arXiv:1509.08169

Published
2015

246. Fluid Performability Analysis of Nested Automata Models

Author

Jane Hillston, Luca Bortolussi, Mirco Tribastone, Jeremy Bradley, William Knottenbelt and Nigel Thomas, Bortolussi, Luca, Hillston, Jane, and Tribastone, Mirco

Subjects
System of systems, Theoretical computer science, General Computer Science, Computer science, software performance modelling, Reliability (computer networking), Systems of systems, Software performance testing, Theoretical Computer Science, Automaton, fluid approximation, Range (mathematics), Fluid approximation, Software performance modeling, Dependability, Systems of system, Software system, Computer Science(all)
Abstract

In this paper we present a class of nested automata for the modelling of performance, availability, and reliability of software systems with hierarchical structure, which we call systems of systems. Quantitative modelling provides valuable insight into the dynamic behaviour of software systems, allowing non-functional properties such as performance, dependability and availability to be assessed. However, the complexity of many systems challenges the feasibility of this approach as the required mathematical models grow too large to afford computationally efficient solution. In recent years it has been found that in some cases a fluid, or mean field, approximation can provide very good estimates whilst dramatically reducing the computational cost.The systems of systems which we propose are hierarchically arranged automata in which influence may be exerted between siblings, between parents and children, and even from children to parents, allowing a wide range of complex dynamics to be captured. We show that, under mild conditions, systems of systems can be equipped with fluid approximation models which are several orders of magnitude more efficient to run than explicit state representations, whilst providing excellent estimates of performability measures. This is a significant extension of previous fluid approximation results, with valuable applications for software performance modelling.

Published
2015

247. Efficient checking of individual rewards properties in Markov population models

Author

Luca Bortolussi, Jane Hillston, Bertrand, Nathalie, Tribastone, Mirco, Bortolussi, Luca, and Hillston, Jane

Subjects
Model checking, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, Computer science, Stochastic Approximation, Population, Markov process, 0102 computer and information sciences, 02 engineering and technology, Systems and Control (eess.SY), Expected value, Stochastic approximation, 01 natural sciences, lcsh:QA75.5-76.95, symbols.namesake, Reward, 0202 electrical engineering, electronic engineering, information engineering, FOS: Electrical engineering, electronic engineering, information engineering, Stochastic Model Checking, Rewards, Markov Population Models, education, Computational linguistics, Expected values, Individual agent, Markovian, Population model, education.field_of_study, Computer Science - Performance, Markov chain, lcsh:Mathematics, 16. Peace & justice, lcsh:QA1-939, Logic in Computer Science (cs.LO), Markov Population Model, Performance (cs.PF), 010201 computation theory & mathematics, symbols, Embedding, Computer Science - Systems and Control, 020201 artificial intelligence & image processing, lcsh:Electronic computers. Computer science
Abstract

In recent years fluid approaches to the analysis of Markov populations models have been demonstrated to have great pragmatic value. Initially developed to estimate the behaviour of the system in terms of the expected values of population counts, the fluid approach has subsequently been extended to more sophisticated interrogations of models through its embedding within model checking procedures. In this paper we extend recent work on checking CSL properties of individual agents within a Markovian population model, to consider the checking of properties which incorporate rewards., Comment: In Proceedings QAPL 2015, arXiv:1509.08169

Published
2015

248. Optimisation of Patch Distribution Strategies for AMR Applications

Author

J. A. Herdman, W. P. Gaudin, David Beckingsale, Stephen A. Jarvis, Oliver Perks, Tribastone, Mirco, and Gilmore, Stephen, 1962

Subjects
Adaptive mesh refinement, Computer science, Computation, Distributed computing, Scalability, Parallel computing, Load balancing (computing), Communication policies, Data availability, QA76
Abstract

As core counts increase in the world's most powerful supercomputers, applications are becoming limited not only by computational power, but also by data availability. In the race to exascale, efficient and effective communication policies are key to achieving optimal application performance. Applications using adaptive mesh refinement (AMR) trade off communication for computational load balancing, to enable the focused computation of specific areas of interest. This class of application is particularly susceptible to the communication performance of the underlying architectures, and are inherently difficult to scale efficiently. In this paper we present a study of the effect of patch distribution strategies on the scalability of an AMR code. We demonstrate the significance of patch placement on communication overheads, and by balancing the computation and communication costs of patches, we develop a scheme to optimise performance of a specific, industry-strength, benchmark application.

Published
2013

249. Don't Just Go with the Flow: Cautionary Tales of Fluid Flow Approximation

Author

Luca Bortolussi, Alireza Pourranjbar, Jane Hillston, M. Tribastone, S. Gilmore, A., Pourranjbar, J., Hillston, Bortolussi, Luca, Tribastone, Mirco, and Gilmore, Stephen

Subjects
Mathematical optimization, Scale (ratio), Fluid approximation, Stochastic process algebra, Stochastic process algebras, Function (mathematics), PEPA, Physics::Fluid Dynamics, Continuous-time Markov chain, Moment (mathematics), Flow (mathematics), Stochastic simulation, Fluid dynamics, Applied mathematics, Parametrization, Mathematics
Abstract

Fluid flow approximation allows efficient analysis of large scale PEPA models. Given a model, this method outputs how the mean, variance, and any other moment of the model’s stochastic behaviour evolves as a function of time. We investigate whether the method’s results, i.e. moments of the behaviour, are sufficient to capture system’s actual dynamics.We ran a series of experiments on a client-server model. For some parametrizations of the model, the model’s behaviour can accurately be characterized by the fluid flow approximations of its moments. However, the experiments show that for some other parametrizations, these moments are not sufficient to capture the model’s behaviour, highlighting a pitfall of relying only on the results of fluid flow analysis. The results suggest that the sufficiency of the fluid flow method for the analysis of a model depends on the model’s concrete parametrization. They also make it clear that the existing criteria for deciding on the sufficiency of the fluid flow method are not robust.

Published
2012

Catalog

Books, media, physical & digital resources
See catalog results