The relation between preset distinguishing sequences and synchronizing sequences
From MaRDI portal
Publication:736851
DOI10.1007/s00165-014-0297-8zbMath1342.68184OpenAlexW2060548618MaRDI QIDQ736851
Kemal İnan, Canan Güniçen, Uraz Cengiz Türker, Hüsnü Yenigün
Publication date: 5 August 2016
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-014-0297-8
Related Items
Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata, Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation, Preset Distinguishing Sequences and Diameter of Transformation Semigroups, Introducing complexity to formal testing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Implementation and application of automata. 17th international conference, CIAA 2012, Porto, Portugal, July 17--20, 2012. Proceedings
- Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
- Lower bounds on lengths of checking sequences
- Synchronizing monotonic automata
- Synchronizing finite automata with short reset words
- Reset words for commutative and solvable automata
- Synchronizing generalized monotonic automata
- Polynomial complete problems in automata theory
- Simulation testing of automata
- Constructing checking sequences for distributed testing
- Testing methods for X-machines: a review
- Model-based testing of reactive systems. Advanced lectures.
- P(l)aying for Synchronization
- Synchronization of Automata with One Undefined or Ambiguous Transition
- Approximating Minimum Reset Sequences
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA
- Testing Software Design Modeled by Finite-State Machines
- Careful Synchronization of Partial Automata with Restricted Alphabets
- Reducibility among Combinatorial Problems
- Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines
- On the Length of Homing Sequences for Nondeterministic Finite State Machines
- Testing finite-state machines: state identification and verification
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- A Method for the Design of Fault Detection Experiments
