Using schedulers to test probabilistic distributed systems
From MaRDI portal
Publication:1941881
DOI10.1007/S00165-012-0244-5zbMath1259.68033OpenAlexW2123469736MaRDI QIDQ1941881
Manuel A. Nunez, Robert M. Hierons
Publication date: 22 March 2013
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-012-0244-5
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Switched PIOA: parallel composition via distributed scheduling
- Distributed testing without encountering controllability and observability problems
- Bisimulation through probabilistic testing
- The synchronization problem in protocol testing and its complexity
- Quiescence, fairness, testing, and the notion of implementation
- Composition and behaviors of probabilistic I/O automata
- Coordination algorithm for distributed testing
- Algebraic theory of probabilistic processes.
- Discrete time generative-reactive probabilistic processes with different advancing speeds
- Testing preorders for probabilistic processes.
- Reactive, generative, and stratified models of probabilistic processes
- Forward and backward simulations. I. Untimed Systems
- Implementation relations and test generation for systems with distributed interfaces
- Overcoming controllability problems in distributed testing from an input output transition system
- Refinement-oriented probability for CSP
- Specification, testing and implementation relations for symbolic-probabilistic systems
- Testing Finitary Probabilistic Processes
- Introduction to Software Testing
- Controllable Test Cases for the Distributed Test Architecture
- A testing scenario for probabilistic processes
- Characterising Testing Preorders for Finite Probabilistic Processes
- The specification statement
This page was built for publication: Using schedulers to test probabilistic distributed systems
