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