Model-based testing of probabilistic systems
From MaRDI portal
Publication:682363
DOI10.1007/s00165-017-0440-4zbMath1380.68303OpenAlexW2782289391MaRDI QIDQ682363
Marcus Gerhold, Mariëlle I. A. Stoelinga
Publication date: 2 February 2018
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-017-0440-4
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Reliability, testing and fault tolerance of networks and computer systems (68M15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
Runtime monitors for Markov decision processes ⋮ Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Interactive Markov chains. And the quest for quantified quality
- Testing a probabilistic FSM using interval estimation
- A calculus of communicating systems
- Bisimulation through probabilistic testing
- Testing equivalences for processes
- Testing preorders for probabilistic processes.
- Using schedulers to test probabilistic distributed systems
- Global minimization of rational functions and the nearest GCDs
- Model-Based Testing of Probabilistic Systems
- A Platform for High Performance Statistical Model Checking – PLASMA
- A testing scenario for probabilistic processes
- Characterising Testing Preorders for Finite Probabilistic Processes
- Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
- Computer Aided Verification
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
- Formal Approaches to Software Testing
- Computer Aided Verification
- FM 2005: Formal Methods
- Testing probabilistic automata
This page was built for publication: Model-based testing of probabilistic systems