Deriving Homing Sequences for Finite State Machines with Timed Guards

DOI10.18255/1818-1015-2020-4-376-395MaRDI QIDQ5060074zbMATH OpenOpenAlexFDO

Authors A. S. Tvardovskii, N. Evtushenko

Publication date 17 January 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

finite-state machinehoming sequenceFSM abstractiontimed guards

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cites work

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

Cited in

(3)

• Distinguishing experiments for timed nondeterministic finite state machines
• On the complexity of existence of homing sequences for nondeterministic finite state machines
• On the Length of Homing Sequences for 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)