Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
DOI10.1007/s00165-011-0206-3zbMath1298.68255OpenAlexW2052240326MaRDI QIDQ470035
Ismael Rodríguez, Fernando Rubio, Pablo Rabanal
Publication date: 11 November 2014
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-011-0206-3
testingevolutionary computationminimum load sequenceriver formation dynamicsweighted finite state machines
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Approximation methods and heuristics in mathematical programming (90C59) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Crossover can be constructive when computing unique input-output sequences
- \(\mathcal {HOTL}\): Hypotheses and observations testing logic
- A General Testability Theory
- A Formal Approach to Heuristically Test Restorable Systems
- Using River Formation Dynamics to Design Heuristic Algorithms
- Testing Software Design Modeled by Finite-State Machines
- Machine Learning Applications in Software Engineering
- Graph Algorithms for Conformance Testing Using the Rural Chinese Postman Tour
- Testing can be formal, too
- Equation of State Calculations by Fast Computing Machines
- Testing finite-state machines: state identification and verification
- Automated Technology for Verification and Analysis
- Branch-and-Bound Methods: A Survey
- A Method for the Design of Fault Detection Experiments
This page was built for publication: Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
