Testing from a stochastic timed system with a fault model

DOI10.1016/J.JLAP.2008.06.001MaRDI QIDQ1001893zbMATH OpenOpenAlexFDO

Authors Robert M. Hierons, Mercedes G. Merayo, Manuel Núñez

Publication date 19 February 2009

Published in The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlap.2008.06.001

zbMATH Keywords

software testingnon-determinismstochastic timefault model

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Formal Techniques for Networked and Distributed Systems - FORTE 2003
• Testing Finite State Machines Presenting Stochastic Time and Timeouts
• Formal testing from timed finite state machines
• Model-based testing of probabilistic systems with stochastic time
• Conformance testing for real-time systems

Cites work

• scientific article; zbMATH DE number 1746452 (Why is no real title available?)
• scientific article; zbMATH DE number 1746453 (Why is no real title available?)
• scientific article; zbMATH DE number 1863172 (Why is no real title available?)
• scientific article; zbMATH DE number 1397300 (Why is no real title available?)
• scientific article; zbMATH DE number 3254909 (Why is no real title available?)
• A process algebra for timed systems
• A testing scenario for probabilistic processes
• A timed model for communicating sequential processes
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Algebraic theory of probabilistic and nondeterministic processes.
• Algebraic theory of probabilistic processes.
• Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
• Formal Approaches to Software Testing
• Formal Techniques for Networked and Distributed Systems - FORTE 2003
• Formal testing from timed finite state machines
• Implementation Relations for Stochastic Finite State Machines
• Reactive, generative, and stratified models of probabilistic processes
• Reduced length checking sequences
• Specification, testing and implementation relations for symbolic-probabilistic systems
• Testing Finite State Machines Presenting Stochastic Time and Timeouts
• Testing Software Design Modeled by Finite-State Machines
• Testing preorders for probabilistic processes.
• Testing timed automata
• The theory of interactive generalized semi-Markov processes
• \(\mathcal {HOTL}\): Hypotheses and observations testing logic

Cited in

(11)

• On conformance testing of non-deterministic systems
• Model-based testing of probabilistic systems with stochastic time
• A fault-detection approach to the conformance testing of nondeterministic systems
• Estimating the latent time of fault detection in finite automaton tested in real time
• Toward a theory of functional testing in discrete dynamic systems
• Passive testing with asynchronous communications and timestamps
• An extended framework for passive asynchronous testing
• Equivalence checking and intersection of deterministic timed finite state machines
• Testing Finite State Machines Presenting Stochastic Time and Timeouts
• Implementation Relations for Stochastic Finite State Machines
• Formal Techniques for Networked and Distributed Systems - FORTE 2003

This page was built for publication: Testing from a stochastic timed system with a fault model

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