Testing Software Design Modeled by Finite-State Machines
From MaRDI portal
Publication:4158482
DOI10.1109/TSE.1978.231496zbMath0379.68039MaRDI QIDQ4158482
Publication date: 1978
Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)
Related Items
A unified integration and component testing approach from deterministic stream X-machine specifications ⋮ Generation of complete test suites from Mealy input/output transition systems ⋮ Exact solutions for the construction of optimal length test sequences ⋮ Testing conformance of a deterministic implementation against a non-deterministic stream X-machine ⋮ Testing against a non-controllable stream X-machine using state counting ⋮ Conformance testing for real-time systems ⋮ Deriving Homing Sequences for Finite State Machines with Timed Guards ⋮ A brief account of runtime verification ⋮ Learning finite state models from recurrent neural networks ⋮ Specification, testing and verification of unconventional computations using generalizedX-machines ⋮ Learning of event-recording automata ⋮ Kernel P systems: from modelling to verification and testing ⋮ A model learning based testing approach for spiking neural P systems ⋮ 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 ⋮ Hardness of Deriving Invertible Sequences from Finite State Machines ⋮ An integration testing method that is proved to find all faults ⋮ Learning Meets Verification ⋮ Kernel P Systems Modelling, Testing and Verification - Sorting Case Study ⋮ Evaluation and Comparison of Inferred Regular Grammars ⋮ A study on the extended unique input/output sequence ⋮ Synchronization paradigm for protocol testing under multiparty configuration ⋮ 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 ⋮ Testing data processing-oriented systems from stream X-machine models ⋮ \(L^\ast\)-based learning of Markov decision processes (extended version) ⋮ \(\mathcal {HOTL}\): Hypotheses and observations testing logic ⋮ Complete model-based equivalence class testing for nondeterministic systems ⋮ FSM-based testing from user defined faults adapted to incremental and mutation testing ⋮ Bounded sequence testing from deterministic finite state machines ⋮ A method for refining and testing generalised machine specifications ⋮ Evolutionary generation of unique input/output sequences for class behavioral testing ⋮ Testing Non-deterministic Stream X-machine Models and P systems ⋮ Testing timed automata ⋮ Formally transforming user-model testing problems into implementer-model testing problems and viceversa ⋮ The complexity of asynchronous model based testing ⋮ Model Driven Testing Based on Test History ⋮ On testing UML statecharts ⋮ Checking experiments for stream X-machines ⋮ Testing based on identifiable P systems using cover automata and X-machines ⋮ Grey-Box Checking ⋮ Testing from a stochastic timed system with a fault model ⋮ The relation between preset distinguishing sequences and synchronizing sequences ⋮ Introducing complexity to formal testing ⋮ Multiple Mutation Testing from FSM ⋮ Testing for refinement in \textsf{Circus} ⋮ Efficient active automata learning via mutation testing ⋮ Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata ⋮ Unnamed Item ⋮ Reduced checking sequences using unreliable reset ⋮ Complexity of node coverage games ⋮ Towards Deriving Test Sequences by Model Checking
