Testing Software Design Modeled by Finite-State Machines
From MaRDI portal
Publication:4158482
DOI10.1109/TSE.1978.231496zbMATH Open0379.68039MaRDI QIDQ4158482FDOQ4158482
Authors: T. S. Chow 
Publication date: 1978
Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)
Cited In (58)
- Apartness and distinguishing formulas in Hennessy-Milner logic
- Learning deterministic one-clock timed automata via mutation testing
- Reverse Engineering Through Automata Learning
- Equivalence checking and intersection of deterministic timed finite state machines
- An optimised complete strategy for testing symbolic finite state machines
- \(\mathcal {HOTL}\): Hypotheses and observations testing logic
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- An integration testing method that is proved to find all faults
- 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
- Efficient active automata learning via mutation testing
- Conformance testing for real-time systems
- Kernel P systems: from modelling to verification and testing
- On testing UML statecharts
- Reduced checking sequences using unreliable reset
- Learning Meets Verification
- A unified integration and component testing approach from deterministic stream X-machine specifications
- Generation of complete test suites from Mealy input/output transition systems
- Complexity of node coverage games
- Kernel P Systems Modelling, Testing and Verification - Sorting Case Study
- Testing timed automata
- Bounded sequence testing from deterministic finite state machines
- The complexity of asynchronous model based testing
- Hardness of Deriving Invertible Sequences from Finite State Machines
- Specification, testing and verification of unconventional computations using generalizedX-machines
- Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata
- FSM-based testing from user defined faults adapted to incremental and mutation testing
- Testing data processing-oriented systems from stream X-machine models
- Checking experiments for stream X-machines
- Benchmarking Combinations of Learning and Testing Algorithms for Active Automata Learning
- The relation between preset distinguishing sequences and synchronizing sequences
- A study on the extended unique input/output sequence
- A model learning based testing approach for kernel P systems
- Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
- Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
- Grey-Box Checking
- Evolutionary generation of unique input/output sequences for class behavioral testing
- Learning finite state models from recurrent neural networks
- Learning register automata: from languages to program structures
- Hardness and inapproximability of minimizing adaptive distinguishing sequences
- Multiple Mutation Testing from FSM
- Learning of event-recording automata
- Exact solutions for the construction of optimal length test sequences
- Towards deriving test sequences by model checking
- Evaluation and Comparison of Inferred Regular Grammars
- A model learning based testing approach for spiking neural P systems
- Testing against a non-controllable stream X-machine using state counting
- A brief account of runtime verification
- Testing for refinement in \textsf{Circus}
- Introducing complexity to formal testing
- Deriving Homing Sequences for Finite State Machines with Timed Guards
- Title not available (Why is that?)
- Testing from a stochastic timed system with a fault model
- Synchronization paradigm for protocol testing under multiparty configuration
- Model Driven Testing Based on Test History
- Complete model-based equivalence class testing for nondeterministic systems
- A method for refining and testing generalised machine specifications
- 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)
