Using Synchronizing Heuristics to Construct Homing Sequences

Berk Çirişci, M. Emek, Ege Sorguç, Kamer Kaya, Husnu Yenigun

Abstract

Computing a shortest synchronizing sequence of an automaton is an NP-Hard problem. There are well-known heuristics to find short synchronizing sequences. Finding a shortest homing sequence is also an NP-Hard problem. Unlike existing heuristics to find synchronizing sequences, homing heuristics are not widely studied. In this paper, we discover a relation between synchronizing and homing sequences by creating an automaton called homing automaton. By applying synchronizing heuristics on this automaton we get short homing sequences. Furthermore, we adapt some of the synchronizing heuristics to construct homing sequences.

Download


Paper Citation


in Harvard Style

Çirişci B., Emek M., Sorguç E., Kaya K. and Yenigun H. (2019). Using Synchronizing Heuristics to Construct Homing Sequences.In Proceedings of the 7th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD, ISBN 978-989-758-358-2, pages 364-371. DOI: 10.5220/0007403503640371


in Bibtex Style

@conference{modelsward19,
author={Berk Çirişci and M. Emek and Ege Sorguç and Kamer Kaya and Husnu Yenigun},
title={Using Synchronizing Heuristics to Construct Homing Sequences},
booktitle={Proceedings of the 7th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,},
year={2019},
pages={364-371},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007403503640371},
isbn={978-989-758-358-2},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 7th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,
TI - Using Synchronizing Heuristics to Construct Homing Sequences
SN - 978-989-758-358-2
AU - Çirişci B.
AU - Emek M.
AU - Sorguç E.
AU - Kaya K.
AU - Yenigun H.
PY - 2019
SP - 364
EP - 371
DO - 10.5220/0007403503640371