Design and Optimisation of the FlyFast Front-end for Attribute-based Coordination

@inproceedings{Latella2017DesignAO,
  title={Design and Optimisation of the FlyFast Front-end for Attribute-based Coordination},
  author={Diego Latella and Mieke Massink},
  booktitle={QAPL@ETAPS},
  year={2017}
}
Collective Adaptive Systems (CAS) consist of a large number of interacting objects. The design of such systems requires scalable analysis tools and methods, which have necessarily to rely on some form of approximation of the system's actual behaviour. Promising techniques are those based on mean-field approximation. The FlyFast model-checker uses an on-the-fly algorithm for bounded PCTL model-checking of selected individual(s) in the context of very large populations whose global behaviour is… 

Figures from this paper

FlyFast: A Scalable Approach to Probabilistic Model-Checking Based on Mean-Field Approximation
TLDR
FlyFast, an on-the-fly model checker developed for approximated bounded PCTL model-checking, based on mean-field population DTMC approximation, and two additional interesting front-ends for FlyFast, a translation from CTMC-based population models and (a fragment of) CSL that allows for approximate probabilistic model- checking in the continuous stochastic time setting.
Quantitative Aspects of Programming Languages and Systems over the past $2^4$ years and beyond
TLDR
The aim of this survey is to revisit such achievements and results from the standpoint of QAPL and its community.

References

SHOWING 1-10 OF 31 REFERENCES
On-the-Fly Mean-Field Model-Checking for Attribute-Based Coordination
TLDR
This paper presents an attribute-based coordination language as a front-end for FlyFast, a formal probabilistic semantics is provided and a translation to the original FlyFast language is given and proved correct.
On-the-fly PCTL fast mean-field approximated model-checking for self-organising coordination
On-the-fly Fast Mean-Field Model-Checking
A novel, scalable, on-the-fly model-checking procedure is presented to verify bounded PCTL properties of selected individuals in the context of very large systems of independent interacting objects.
A logic for model-checking mean-field models
TLDR
This paper defines and motivate a logic MF- CSL for describing properties of systems composed of many identical interacting objects and explains how the set of all time instances that fulfill a given MF-CSL formula for a certain distribution of objects can be computed.
An Abstract, on the Fly Framework for the Verification of Service-Oriented Systems
TLDR
This chapter presents (some of) the design principles which have inspired the development of the CMC/UMC verification framework, and the usefulness of an on-the-fly, bounded model-checking approach for an efficient, interactive analysis of service-oriented systems.
On-the-fly Probabilistic Model Checking
TLDR
An efficient, on-the-fly, PCTL model checking procedure that is parametric with respect to the semantic interpretation of the language is proposed and its efficiency is compared with a global P CTL model checker on representative applications.
Efficient on-the-fly model checking for CTL
TLDR
An on-the-fly algorithm for determining whether a finite-state system satisfies a formula in the temporal logic CTL, and it performs as well as the best known global algorithms for the sublogics CTL and LTL.
INFAMY: An Infinite-State Markov Model Checker
TLDR
INFAMY is a model checker for arbitrarily structured infinite-state CTMCs, which checks probabilistic timing properties expressible in continuous stochastic logic (CSL).
Principles of model checking
TLDR
Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
Memory-efficient algorithms for the verification of temporal properties
TLDR
Algorithms are presented that solve the emptiness problem without explicitly constructing the strongly connected components of the graph representing the product automaton by allowing the algorithms to err with some probability.
...
...