Specification, testing and implementation relations for symbolic-probabilistic systems

DOI10.1016/J.TCS.2005.10.047MaRDI QIDQ2368993zbMATH OpenOpenAlexFDO

Authors Natalia López, Ismael Rodríguez, Manuel Núñez

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 testingSymbolic-probabilistic finite state machinesTest derivation and application

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Formal Approaches to Software Testing
• Applying Formal Methods: Testing, Performance, and M/E-Commerce
• Symbolic model checking for probabilistic processes
• Specification Theories for Probabilistic and Real-Time Systems
• Model Checking Software
• Validation of Stochastic Systems
• Symbolic model checking for factored probabilistic models
• scientific article; zbMATH DE number 1754609

Cites work

• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 2038731 (Why is no real title available?)
• scientific article; zbMATH DE number 938070 (Why is no real title available?)
• A timed model for communicating sequential processes
• Algebraic theory of probabilistic and nondeterministic processes.
• Algebraic theory of probabilistic processes.
• Applying Formal Methods: Testing, Performance, and M/E-Commerce
• Bisimulation through probabilistic testing
• Discrete time generative-reactive probabilistic processes with different advancing speeds
• Formal Approaches to Software Testing
• Formal Techniques for Networked and Distributed Systems - FORTE 2003
• Priority in process algebra.
• Probabilistic extensions of process algebras.
• Process algebra with timing
• Reactive, generative, and stratified models of probabilistic processes
• Testing equivalences for processes
• Testing preorders for probabilistic processes.
• Testing probabilistic automata
• Validation of Stochastic Systems

Cited in

(15)

• Applying Formal Methods: Testing, Performance, and M/E-Commerce
• Controllable Test Cases for the Distributed Test Architecture
• Model-based testing of probabilistic systems
• Model-based testing of probabilistic systems
• Testing a probabilistic FSM using interval estimation
• A General Testability Theory
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Using schedulers to test probabilistic distributed systems
• Symbolic computing in probabilistic and stochastic analysis
• Formal Approaches to Software Testing
• Introducing complexity to formal testing
• Customized Testing for Probabilistic Systems
• Testing from a stochastic timed system with a fault model
• Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems
• scientific article; zbMATH DE number 1324657 (Why is no real title available?)

This page was built for publication: Specification, testing and implementation relations for symbolic-probabilistic systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368993)