61 Result(s)

within Jane Hillston

Relevance Newest First Oldest First
previous Page of 4
and
  1. Open Access This content is freely available online to anyone, anywhere at any time.

    Article

    Unbiased Bayesian inference for population Markov jump processes via random truncations

    We consider continuous time Markovian processes where populations of individual agents interact stochastically according to kinetic rules. Despite the increasing prominence of such models in fields ranging fro...

    Anastasis Georgoulas, Jane Hillston, Guido Sanguinetti in Statistics and Computing (2017)

  2. No Access

    Book

    Formal Methods for the Quantitative Evaluation of Collective Adaptive Systems

    Formal Methods for the Quantitative Evaluation of Collective Adaptive Systems

    16th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2016, Bertinoro, Italy, June 20-24, 2016, Advanced Lectures

    Marco Bernardo, Rocco De Nicola in Lecture Notes in Computer Science (2016)

  3. No Access

    Chapter and Conference Paper

    Quantitative Analysis of Collective Adaptive Systems

    Quantitative formal methods, such as stochastic process algebras, have been used for the last twenty years to support modelling of dynamic systems in order to investigate their performance. Application domains...

    Jane Hillston in Perspectives of System Informatics (2016)

  4. No Access

    Chapter and Conference Paper

    CARMA Eclipse Plug-in: A Tool Supporting Design and Analysis of Collective Adaptive Systems

    Collective Adaptive Systems (CAS) are heterogeneous populations of autonomous task-oriented agents that cooperate on common goals forming a collective system. This class of systems is typically composed of a h...

    Jane Hillston, Michele Loreti in Quantitative Evaluation of Systems (2016)

  5. No Access

    Chapter and Conference Paper

    Property-Driven State-Space Coarsening for Continuous Time Markov Chains

    Dynamical systems with large state-spaces are often expensive to thoroughly explore experimentally. Coarse-graining methods aim to define simpler systems which are more amenable to analysis and exploration; mo...

    Michalis Michaelides, Dimitrios Milios, Jane Hillston in Quantitative Evaluation of Systems (2016)

  6. No Access

    Chapter and Conference Paper

    Moment-Based Probabilistic Prediction of Bike Availability for Bike-Sharing Systems

    We study the problem of future bike availability prediction of a bike station through the moment analysis of a PCTMC model with time-dependent rates. Given a target station for prediction, the moments of the n...

    Cheng Feng, Jane Hillston, Daniël Reijsbergen in Quantitative Evaluation of Systems (2016)

  7. No Access

    Chapter

    Modelling and Analysis of Collective Adaptive Systems with CARMA and its Tools

    Collective Adaptive Systems (CAS) are heterogeneous collections of autonomous task-oriented systems that cooperate on common goals forming a collective system. This class of systems is typically composed of a ...

    Michele Loreti, Jane Hillston in Formal Methods for the Quantitative Evalua… (2016)

  8. No Access

    Chapter

    Abstract Interpretation of PEPA Models

    This paper relates the fluid-flow semantics of the stochastic process algebra PEPA (Performance Evaluation Process Algebra) to the static analysis technique of abstract interpretation. The explanation in the pape...

    Stephen Gilmore, Jane Hillston, Natalia Zoń in Semantics, Logics, and Calculi (2016)

  9. No Access

    Chapter and Conference Paper

    Specification and Analysis of Open-Ended Systems with CARMA

    Carma is a new language recently defined to support quantified specification and analysis of collective adaptive systems. It is a stochastic process algebra equipped with linguistic constructs specifically d...

    Jane Hillston, Michele Loreti in Agent Environments for Multi-Agent Systems IV (2015)

  10. No Access

    Chapter

    Service Composition for Collective Adaptive Systems

    Collective adaptive systems are large-scale resource-sharing systems which adapt to the demands of their users by redistributing resources to balance load or provide alternative services where the current prov...

    Stephen Gilmore, Jane Hillston, Mirco Tribastone in Software, Services, and Systems (2015)

  11. No Access

    Chapter and Conference Paper

    Speed-Up of Stochastic Simulation of PCTMC Models by Statistical Model Reduction

    We present a novel statistical model reduction method which can significantly boost the speed of stochastic simulation of a population continuous-time Markov chain (PCTMC) model. This is achieved by identifyin...

    Cheng Feng, Jane Hillston in Computer Performance Engineering (2015)

  12. No Access

    Chapter and Conference Paper

    Challenges for Quantitative Analysis of Collective Adaptive Systems

    We are surrounded by both natural and engineered collective systems. Such systems include many entities, which interact locally and, without necessarily having any global knowledge, nevertheless work together to ...

    Jane Hillston in Trustworthy Global Computing (2014)

  13. No Access

    Chapter and Conference Paper

    Automated Capacity Planning for PEPA Models

    Capacity planning is concerned with the provisioning of systems in order to ensure that they meet the demand or performance requirements of users. Currently for PEPA models, a modeller who wishes to solve a ca...

    Christopher D. Williams, Jane Hillston in Computer Performance Engineering (2014)

  14. No Access

    Chapter and Conference Paper

    Probabilistic Programming Process Algebra

    Formal modelling languages such as process algebras are widespread and effective tools in computational modelling. However, handling data and uncertainty in a statistically meaningful way is an open problem in...

    Anastasis Georgoulas, Jane Hillston, Dimitrios Milios in Quantitative Evaluation of Systems (2014)

  15. No Access

    Chapter and Conference Paper

    The Benefits of Sometimes Not Being Discrete

    Discrete representations of systems are usual in theoretical computer science and they have many benefits. Unfortunately they also suffer from the problem of state space explosion, sometimes termed the curse of d...

    Jane Hillston in CONCUR 2014 – Concurrency Theory (2014)

  16. No Access

    Chapter and Conference Paper

    PALOMA: A Process Algebra for Located Markovian Agents

    We present a novel stochastic process algebra that allows the expression of models representing systems comprised of populations of agents distributed over space, where the relative positions of agents influen...

    Cheng Feng, Jane Hillston in Quantitative Evaluation of Systems (2014)

  17. No Access

    Article

    HYPE: Hybrid modelling by composition of flows

    Hybrid systems are manifest in both the natural and the engineered world, and their complex nature, mixing discrete control and continuous evolution, make it difficult to predict their behaviour. In recent yea...

    Vashti Galpin, Luca Bortolussi, Jane Hillston in Formal Aspects of Computing (2013)

  18. No Access

    Chapter and Conference Paper

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

    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 f...

    Alireza Pourranjbar, Jane Hillston, Luca Bortolussi in Computer Performance Engineering (2013)

  19. No Access

    Chapter

    Checking Individual Agent Behaviours in Markov Population Models by Fluid Approximation

    In this chapter, we will describe, in a tutorial style, recent work on the use of fluid approximation techniques in the context of stochastic model checking. We will discuss the theoretical background and the ...

    Luca Bortolussi, Jane Hillston in Formal Methods for Dynamical Systems (2013)

  20. No Access

    Chapter and Conference Paper

    ABC–Fun: A Probabilistic Programming Language for Biology

    Formal methods have long been employed to capture the dynamics of biological systems in terms of Continuous Time Markov Chains. The formal approach enables the use of elegant analysis tools such as model check...

    Anastasis Georgoulas, Jane Hillston in Computational Methods in Systems Biology (2013)

previous Page of 4