Deriving Homing Sequences for Finite State Machines with Timed Guards

DOI10.18255/1818-1015-2020-4-376-395OpenAlexW3114822265MaRDI QIDQ5060074FDOQ5060074

Authors: A. S. Tvardovskii, N. Evtushenko 

Publication date: 17 January 2023

Published in: Modeling and Analysis of Information Systems (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mais723

Recommendations

• Describing homing and distinguishing sequences for nondeterministic finite state machines via synchronizing automata
• Distinguishing experiments for timed nondeterministic finite state machines
• On the Length of Homing Sequences for Nondeterministic Finite State Machines
• On the complexity of existence of homing sequences for nondeterministic finite state machines
• State identification, existence of sequences and machine classification

zbMATH Keywords

finite-state machinehoming sequenceFSM abstractiontimed guards

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Deterministic timed finite state machines: equivalence checking and expressive power
• Testing Software Design Modeled by Finite-State Machines
• Title not available (Why is that?)
• Preset and adaptive homing experiments for nondeterministic finite state machines
• On the Length of Homing Sequences for Nondeterministic Finite State Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A passive testing approach based on invariants: application to the WAP
• Testing finite-state machines: state identification and verification
• Conformance testing for real-time systems
• Formal testing from timed finite state machines
• Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
• The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
• Distinguishing experiments for timed nondeterministic finite state machines
• Reduced checking sequences using unreliable reset
• Describing homing and distinguishing sequences for nondeterministic finite state machines via synchronizing automata

Cited In (3)

• On the complexity of existence of homing sequences for nondeterministic finite state machines
• On the Length of Homing Sequences for Nondeterministic Finite State Machines
• Distinguishing experiments for timed nondeterministic finite state machines

This page was built for publication: Deriving Homing Sequences for Finite State Machines with Timed Guards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060074)