Testing from a stochastic timed system with a fault model

DOI10.1016/j.jlap.2008.06.001zbMath1161.68026OpenAlexW2055530557MaRDI QIDQ1001893

Robert M. Hierons, Mercedes G. Merayo, Manuel A. Nunez

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) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Passive testing with asynchronous communications and timestamps ⋮ An extended framework for passive asynchronous testing ⋮ Equivalence checking and intersection of deterministic timed finite state machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• The theory of interactive generalized semi-Markov processes
• Testing preorders for probabilistic processes.
• A process algebra for timed systems
• Reactive, generative, and stratified models of probabilistic processes
• Specification, testing and implementation relations for symbolic-probabilistic systems
• \(\mathcal {HOTL}\): Hypotheses and observations testing logic
• Formal testing from timed finite state machines
• Reduced length checking sequences
• Testing Finite State Machines Presenting Stochastic Time and Timeouts
• A testing scenario for probabilistic processes
• Implementation Relations for Stochastic Finite State Machines
• Testing Software Design Modeled by Finite-State Machines
• 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
• Testing timed automata