Pages that link to "Item:Q2565429"
From MaRDI portal
The following pages link to Model-based testing of reactive systems. Advanced lectures. (Q2565429):
Displaying 48 items.
- Generation of complete test suites from Mealy input/output transition systems (Q282098) (← links)
- Projecting transition systems: overcoming state explosion in concurrent system verification (Q300375) (← links)
- Input-output conformance testing for software product lines (Q338614) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- Generating tests from B specifications and dynamic selection criteria (Q539227) (← links)
- Synchronizing automata with finitely many minimal synchronizing words (Q553327) (← links)
- Information gain of black-box testing (Q640298) (← links)
- Active learning for extended finite state machines (Q736459) (← links)
- Test generation from state based use case models (Q736788) (← links)
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
- Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
- A deductive approach towards reasoning about algebraic transition systems (Q1666122) (← links)
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) (Q1989347) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- On checking equivalence of simulation scripts (Q2035653) (← links)
- Learning finite state models from recurrent neural networks (Q2165516) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Synchronizing sequences for road colored digraphs (Q2197412) (← links)
- Test generation from event system abstractions to cover their states and transitions (Q2216864) (← links)
- Constrained synchronization and commutativity (Q2235741) (← links)
- An abstract framework for choreographic testing (Q2239278) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Test purpose oriented I/O conformance test selection with colored Petri nets (Q2336614) (← links)
- Reduced checking sequences using unreliable reset (Q2339596) (← links)
- Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
- A brief account of runtime verification (Q2390027) (← links)
- Towards Deriving Test Sequences by Model Checking (Q2873605) (← links)
- Inferring Canonical Register Automata (Q2891417) (← links)
- Automata Learning with Automated Alphabet Abstraction Refinement (Q3075487) (← links)
- Model-Based Test Selection for Infinite-State Reactive Systems (Q3525109) (← links)
- Learning Meets Verification (Q3525110) (← links)
- The Length of Subset Reachability in Nondeterministic Automata (Q4982094) (← links)
- (Q5013880) (← links)
- (Q5019694) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach (Q5079769) (← links)
- (Q5089200) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- Active Diagnosis for Switched Systems Using Mealy Machine Modeling (Q5117250) (← links)
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems (Q5158671) (← links)
- Model-Based Testing (Q5175779) (← links)
- Symbolic Model-based Test Selection (Q5179362) (← links)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
- A survey on observability of Boolean control networks (Q6063112) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
- Assumption-based runtime verification (Q6102167) (← links)
