Model-based testing of reactive systems. Advanced lectures.
From MaRDI portal
Publication:2565429
DOI10.1007/b137241zbMath1070.68088OpenAlexW1509343160MaRDI QIDQ2565429
No author found.
Publication date: 27 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137241
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (49)
Generation of complete test suites from Mealy input/output transition systems ⋮ Inferring Canonical Register Automata ⋮ Projecting transition systems: overcoming state explosion in concurrent system verification ⋮ Synchronizing automata preserving a chain of partial orders ⋮ A brief account of runtime verification ⋮ Input-output conformance testing for software product lines ⋮ Learning finite state models from recurrent neural networks ⋮ A deductive approach towards reasoning about algebraic transition systems ⋮ Careful synchronization of partial deterministic finite automata ⋮ Synchronizing automata with a letter of deficiency 2 ⋮ Never-stop context-free learning ⋮ A survey on observability of Boolean control networks ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Assumption-based runtime verification ⋮ Synchronizing sequences for road colored digraphs ⋮ Active Diagnosis for Switched Systems Using Mealy Machine Modeling ⋮ Information gain of black-box testing ⋮ Unnamed Item ⋮ Model-Based Test Selection for Infinite-State Reactive Systems ⋮ Learning Meets Verification ⋮ Unnamed Item ⋮ Test generation from event system abstractions to cover their states and transitions ⋮ Improving active Mealy machine learning for protocol conformance testing ⋮ Hardness and inapproximability of minimizing adaptive distinguishing sequences ⋮ Constrained synchronization and commutativity ⋮ An abstract framework for choreographic testing ⋮ Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) ⋮ A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ Generating tests from B specifications and dynamic selection criteria ⋮ Model-Based Testing ⋮ Synchronizing automata with finitely many minimal synchronizing words ⋮ Symbolic Model-based Test Selection ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction ⋮ Unnamed Item ⋮ On checking equivalence of simulation scripts ⋮ Active learning for extended finite state machines ⋮ Test generation from state based use case models ⋮ The relation between preset distinguishing sequences and synchronizing sequences ⋮ Automata Learning with Automated Alphabet Abstraction Refinement ⋮ Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach ⋮ Synchronization problems in automata without non-trivial cycles ⋮ Semicomputable points in Euclidean spaces ⋮ The Length of Subset Reachability in Nondeterministic Automata ⋮ Test purpose oriented I/O conformance test selection with colored Petri nets ⋮ Reduced checking sequences using unreliable reset ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems ⋮ Towards Deriving Test Sequences by Model Checking ⋮ Computing the shortest reset words of synchronizing automata
This page was built for publication: Model-based testing of reactive systems. Advanced lectures.
