Specification, testing and implementation relations for symbolic-probabilistic systems

DOI10.1016/j.tcs.2005.10.047zbMath1088.68021MaRDI QIDQ2368993

Manuel A. Nunez, Ismael Rodríguez, Natalia López

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

zbMATH Keywords

Conformance testing; Symbolic-probabilistic finite state machines; Test derivation and application

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Testing from a stochastic timed system with a fault model, Using schedulers to test probabilistic distributed systems, Probabilistic may/must testing: retaining probabilities by restricted schedulers, A General Testability Theory, Controllable Test Cases for the Distributed Test Architecture, Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems

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