Specification, testing and implementation relations for symbolic-probabilistic systems

DOI10.1016/J.TCS.2005.10.047zbMATH Open1088.68021OpenAlexW2012948837MaRDI QIDQ2368993FDOQ2368993

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

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

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)

Cites Work

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

Cited In (12)

• Controllable Test Cases for the Distributed Test Architecture
• 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
• Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems
• Title not available (Why is that?)
• Testing from a stochastic timed system with a fault model
• Applying Formal Methods: Testing, Performance, and M/E-Commerce

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)