Specification, testing and implementation relations for symbolic-probabilistic systems
From MaRDI portal
Publication:2368993
DOI10.1016/j.tcs.2005.10.047zbMath1088.68021OpenAlexW2012948837MaRDI QIDQ2368993
Natalia López, Ismael Rodríguez, Manuel A. Nunez
Publication date: 28 April 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.047
Formal languages and automata (68Q45) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (8)
A General Testability Theory ⋮ Symbolic computing in probabilistic and stochastic analysis ⋮ Using schedulers to test probabilistic distributed systems ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Controllable Test Cases for the Distributed Test Architecture ⋮ Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems ⋮ Testing from a stochastic timed system with a fault model ⋮ Introducing complexity to formal testing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A timed model for communicating sequential processes
- Bisimulation through probabilistic testing
- Testing equivalences for processes
- Algebraic theory of probabilistic and nondeterministic processes.
- Algebraic theory of probabilistic processes.
- Process algebra with timing
- Discrete time generative-reactive probabilistic processes with different advancing speeds
- Testing preorders for probabilistic processes.
- Reactive, generative, and stratified models of probabilistic processes
- Validation of Stochastic Systems
- Applying Formal Methods: Testing, Performance, and M/E-Commerce
- Formal Approaches to Software Testing
- Formal Techniques for Networked and Distributed Systems - FORTE 2003
- Testing probabilistic automata
This page was built for publication: Specification, testing and implementation relations for symbolic-probabilistic systems
