On-the-fly model checking for extended action-based probabilistic operators

@article{Mateescu2018OntheflyMC,
  title={On-the-fly model checking for extended action-based probabilistic operators},
  author={Radu Mateescu and Jos{\'e} Ignacio Requeno},
  journal={International Journal on Software Tools for Technology Transfer},
  year={2018},
  volume={20},
  pages={563-587}
}
The quantitative analysis of concurrent systems requires expressive and user-friendly property languages combining temporal, data handling, and quantitative aspects. In this paper, we aim at facilitating the quantitative analysis of systems modeled as PTSs (Probabilistic Transition Systems) labeled by actions containing data values and probabilities. We propose a new regular probabilistic operator that specifies the probability measure of a path described by a generalized regular formula… 
On-the-fly model checking for extended action-based probabilistic operators
TLDR
This paper proposes a new regular probabilistic operator that specifies the probability measure of a path described by a generalized regular formula involving arbitrary computations on data values, and integrated it into MCL (Model Checking Language) and devised an associated on-the-fly model checking method.
Model checking: recent improvements and applications
  • D. Bosnacki, Anton Wijs
  • Computer Science
    International Journal on Software Tools for Technology Transfer
  • 2018
TLDR
Several contributions in the model checking field are discussed that address both its scalability and its applicability to perform planning and quantitative analysis, and six papers selected from the 23rd International SPIN Symposium on Model Checking Software are introduced.
Improving Graph-based methods for computing qualitative properties of markov decision processes
TLDR
The proposed heuristic approximates the set of states that are computed in the standard pre-computation methods and can compute a main part of the expected states, while reduces the running time by several orders of magnitude.
Probabilistic Model Checking of BPMN Processes at Runtime
TLDR
This paper defines an approach to perform probabilistic model checking of BPMN models at runtime by analysing the execution traces obtained when running multiple instances of the process, and generates a Probabilistic Transition System (PTS).
Towards Formal Verification of Autonomous Driving Supervisor Functions
TLDR
The approach that aims at analysing a collection of automotive requirements by using formal methods for formal verification is presented and is evaluated by the application to supervisor functions of the autonomous driving system, the system in charge of self-driving.

References

SHOWING 1-10 OF 63 REFERENCES
On-the-fly model checking for extended action-based probabilistic operators
TLDR
This paper proposes a new regular probabilistic operator that specifies the probability measure of a path described by a generalized regular formula involving arbitrary computations on data values, and integrated it into MCL (Model Checking Language) and devised an associated on-the-fly model checking method.
A Model Checking Language for Concurrent Value-Passing Systems
TLDR
The main Mcl ingredients are parameterized fixed points, action patterns extracting data values from Lts actions, modalities on transition sequences described using extended regular expressions and programming language constructs, and an infinite looping operator specifying fairness.
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
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.
Probabilistic temporal logics via the modal mu-calculus
PMaude: Rewrite-based Specification Language for Probabilistic Object Systems
Model Checking Markov Chains with Actions and State Labels
TLDR
The logic as CSL is introduced which provides a powerful means to characterize execution paths of Markov chains with actions and state labels and it is shown that even the state-based fragment of asCSL is strictly more expressive than CSL if time intervals starting at zero are employed.
PRISM 4.0: Verification of Probabilistic Real-Time Systems
TLDR
A major new release of the PRISMprobabilistic model checker is described, adding, in particular, quantitative verification of (priced) probabilistic timed automata.
Model Checking
TLDR
Model checking is applied concurrently with system design, and particularly in its early stages when systems are modelled at a high level of abstraction, because the payoff of finding bugs at that stage is highest whereas the costs are low.
...
...