Model-based testing of reactive systems. Advanced lectures.
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60)
Recommendations
Cited in
(65)- Synchronizing automata with a letter of deficiency 2
- A deductive approach towards reasoning about algebraic transition systems
- Constrained synchronization and commutativity
- Simulator semantics for system level formal verification
- FM 2005: Formal Methods
- Test generation from event system abstractions to cover their states and transitions
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)
- Extending fairness expressibility of ECTL\(^+\): a tree-style one-pass tableau approach
- Generating tests from B specifications and dynamic selection criteria
- scientific article; zbMATH DE number 1951206 (Why is no real title available?)
- Test purpose oriented I/O conformance test selection with colored Petri nets
- Reduced checking sequences using unreliable reset
- Generation of complete test suites from Mealy input/output transition systems
- Learning Meets Verification
- Incremental learning-based testing for reactive systems
- scientific article; zbMATH DE number 1746453 (Why is no real title available?)
- Exhaustive property oriented model-based testing with symbolic finite state machines
- Never-stop context-free learning
- An abstract framework for choreographic testing
- The complexity of asynchronous model based testing
- Model-based testing
- An abstract framework for choreographic testing
- Projecting transition systems: overcoming state explosion in concurrent system verification
- Assumption-based runtime verification
- Test generation from integrated system models capturing state-based and MSC-based notations
- Active learning for extended finite state machines
- The relation between preset distinguishing sequences and synchronizing sequences
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Model based testing with logical properties versus state machines
- scientific article; zbMATH DE number 7559404 (Why is no real title available?)
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
- On checking equivalence of simulation scripts
- Model-Based Test Selection for Infinite-State Reactive Systems
- scientific article; zbMATH DE number 1746452 (Why is no real title available?)
- Test generation from state based use case models
- Combining Scenario- and Model-Based Testing to Ensure POSIX Compliance
- Synchronizing automata preserving a chain of partial orders
- scientific article; zbMATH DE number 1390244 (Why is no real title available?)
- Input-output conformance testing for software product lines
- Careful synchronization of partial deterministic finite automata
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
- Improving active Mealy machine learning for protocol conformance testing
- Hardness and inapproximability of minimizing adaptive distinguishing sequences
- Learning finite state models from recurrent neural networks
- Synchronizing automata with finitely many minimal synchronizing words
- Active diagnosis for switched systems using Mealy machine modeling
- Model-Based Mutation Testing of Reactive Systems
- scientific article; zbMATH DE number 1693523 (Why is no real title available?)
- A survey on observability of Boolean control networks
- Information gain of black-box testing
- Testing interruptions in reactive systems
- Towards deriving test sequences by model checking
- A multi-parameter analysis of hard problems on deterministic finite automata
- A brief account of runtime verification
- Computing the shortest reset words of synchronizing automata
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- Symbolic Model-based Test Selection
- The length of subset reachability in nondeterministic automata
- Synchronizing sequences for road colored digraphs
- Automata learning with automated alphabet abstraction refinement
- Inferring canonical register automata
- Automated testing of asynchronous nondeterministic systems with data.
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Model Driven Testing Based on Test History
- Semicomputable points in Euclidean spaces
This page was built for publication: Model-based testing of reactive systems. Advanced lectures.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565429)
