Testing Software Design Modeled by Finite-State Machines

Cited in

(58)

Apartness and distinguishing formulas in Hennessy-Milner logic
Reverse Engineering Through Automata Learning
Learning deterministic one-clock timed automata via mutation testing
An optimised complete strategy for testing symbolic finite state machines
Equivalence checking and intersection of deterministic timed finite state machines
Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
Testing data processing-oriented systems from stream X-machine models
Learning Meets Verification
A brief account of runtime verification
scientific article; zbMATH DE number 7407787 (Why is no real title available?)
Kernel P systems: from modelling to verification and testing
Bounded sequence testing from deterministic finite state machines
Exact solutions for the construction of optimal length test sequences
On testing UML statecharts
A unified integration and component testing approach from deterministic stream X-machine specifications
Generation of complete test suites from Mealy input/output transition systems
Benchmarking combinations of learning and testing algorithms for active automata learning
\(\mathcal {HOTL}\): Hypotheses and observations testing logic
Hardness of deriving invertible sequences from finite state machines
Grey-Box Checking
Complexity of node coverage games
Checking experiments for stream X-machines
\(L^\ast\)-based learning of Markov decision processes (extended version)
Formally transforming user-model testing problems into implementer-model testing problems and viceversa
Model Driven Testing Based on Test History
A model learning based testing approach for kernel P systems
The complexity of asynchronous model based testing
The relation between preset distinguishing sequences and synchronizing sequences
Synchronization paradigm for protocol testing under multiparty configuration
Efficient active automata learning via mutation testing
Deriving Homing Sequences for Finite State Machines with Timed Guards
Towards deriving test sequences by model checking
Specification, testing and verification of unconventional computations using generalizedX-machines
Kernel P systems modelling, testing and verification -- sorting case study
Evolutionary generation of unique input/output sequences for class behavioral testing
A method for refining and testing generalised machine specifications
FSM-based testing from user defined faults adapted to incremental and mutation testing
Evaluation and Comparison of Inferred Regular Grammars
Reduced checking sequences using unreliable reset
Complete model-based equivalence class testing for nondeterministic systems
Testing for refinement in \textsf{Circus}
Learning of event-recording automata
Introducing complexity to formal testing
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
A model learning based testing approach for spiking neural P systems
Testing from a stochastic timed system with a fault model
Multiple mutation testing from FSM
Conformance testing for real-time systems
Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
Testing based on identifiable P systems using cover automata and X-machines
Testing against a non-controllable stream X-machine using state counting
Testing timed automata
A study on the extended unique input/output sequence
An integration testing method that is proved to find all faults
Learning finite state models from recurrent neural networks
Learning register automata: from languages to program structures
Hardness and inapproximability of minimizing adaptive distinguishing sequences
Testing non-deterministic stream X-machine models and P systems

This page was built for publication: Testing Software Design Modeled by Finite-State Machines

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