Pages that link to "Item:Q4158482"
From MaRDI portal
The following pages link to Testing Software Design Modeled by Finite-State Machines (Q4158482):
Displaying 50 items.
- A unified integration and component testing approach from deterministic stream X-machine specifications (Q282085) (← links)
- Generation of complete test suites from Mealy input/output transition systems (Q282098) (← links)
- A study on the extended unique input/output sequence (Q456677) (← links)
- Testing restorable systems: formal definition and heuristic solution based on river formation dynamics (Q470035) (← links)
- Learning register automata: from languages to program structures (Q479461) (← links)
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- Complete model-based equivalence class testing for nondeterministic systems (Q520246) (← links)
- Learning of event-recording automata (Q604474) (← links)
- The complexity of asynchronous model based testing (Q714798) (← links)
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Testing for refinement in \textsf{Circus} (Q766162) (← links)
- Conformance testing for real-time systems (Q842583) (← links)
- Testing data processing-oriented systems from stream X-machine models (Q944368) (← links)
- Bounded sequence testing from deterministic finite state machines (Q964395) (← links)
- Evolutionary generation of unique input/output sequences for class behavioral testing (Q971720) (← links)
- Checking experiments for stream X-machines (Q987982) (← links)
- Testing from a stochastic timed system with a fault model (Q1001893) (← links)
- Exact solutions for the construction of optimal length test sequences (Q1334626) (← links)
- FSM-based testing from user defined faults adapted to incremental and mutation testing (Q1758717) (← links)
- Testing conformance of a deterministic implementation against a non-deterministic stream X-machine (Q1882901) (← links)
- Synchronization paradigm for protocol testing under multiparty configuration (Q1963369) (← links)
- \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
- Learning finite state models from recurrent neural networks (Q2165516) (← links)
- Formally transforming user-model testing problems into implementer-model testing problems and viceversa (Q2270684) (← links)
- Testing based on identifiable P systems using cover automata and X-machines (Q2282267) (← links)
- Introducing complexity to formal testing (Q2291824) (← links)
- Efficient active automata learning via mutation testing (Q2331082) (← links)
- Reduced checking sequences using unreliable reset (Q2339596) (← links)
- Complexity of node coverage games (Q2344734) (← links)
- Testing against a non-controllable stream X-machine using state counting (Q2368996) (← links)
- A brief account of runtime verification (Q2390027) (← links)
- Kernel P systems: from modelling to verification and testing (Q2413314) (← links)
- \(\mathcal {HOTL}\): Hypotheses and observations testing logic (Q2469152) (← links)
- On testing UML statecharts (Q2500697) (← links)
- A model learning based testing approach for spiking neural P systems (Q2672640) (← links)
- Multiple Mutation Testing from FSM (Q2827468) (← links)
- Towards Deriving Test Sequences by Model Checking (Q2873605) (← links)
- Specification, testing and verification of unconventional computations using generalized<i>X</i>-machines (Q2930717) (← links)
- Hardness of Deriving Invertible Sequences from Finite State Machines (Q2971131) (← links)
- Kernel P Systems Modelling, Testing and Verification - Sorting Case Study (Q2975916) (← links)
- Learning Meets Verification (Q3525110) (← links)
- Evaluation and Comparison of Inferred Regular Grammars (Q3528425) (← links)
- Model Driven Testing Based on Test History (Q3599217) (← links)
- Grey-Box Checking (Q3613088) (← links)
- A method for refining and testing generalised machine specifications (Q3838255) (← links)
- An integration testing method that is proved to find all faults (Q4340156) (← links)
- Deriving Homing Sequences for Finite State Machines with Timed Guards (Q5060074) (← links)
- (Q5155676) (← links)
- Testing Non-deterministic Stream X-machine Models and P systems (Q5179428) (← links)
- Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata (Q5250279) (← links)
