Skip to main content
Communications in Computer and Information ScienceVolume 1090 CCIS, 2019, Pages 103-11818th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019; Ekaterinburg; Russian Federation; 8 July 2019 through 12 July 2019; Code 233779

Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata(Conference Paper)(Open Access)

  Save all to author list
  • aFaculty of Electronic Engineering, Menoufia University, Menouf, Egypt
  • bInstitute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russian Federation

Abstract

We approach the task of computing a carefully synchronizing word of minimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invoking a SAT solver. Our experimental results demonstrate that this approach gives satisfactory results for automata with up to 100 states even if very modest computational resources are used. © 2019, Springer Nature Switzerland AG.

Author keywords

Careful synchronizationCarefully synchronizing wordDeterministic automatonNondeterministic automatonPartial deterministic automatonSATSAT solver

Indexed keywords

Engineering controlled terms:Automata theoryDecision theoryModel checkingOperations researchOptimizationSynchronization
Engineering uncontrolled termsComputational resourcesDeterministic automataNondeterministic automataSAT solversSynchronizing words
Engineering main heading:Robots

Funding details

Funding sponsor Funding number Acronym
Ministry of Education and Science of the Russian FederationMinobrnauka
Ural Federal UniversityUrFU
Ministry of Science and Higher Education of the Russian Federation1.3253.2017,1.580.2016

  • 1

    Supported by the Ministry of Science and Higher Education of the Russian Federation, projects no. 1.580.2016 and 1.3253.2017, and the Competitiveness Enhancement Program of Ural Federal University.

  • ISSN: 18650929
  • ISBN: 978-303033393-5
  • Source Type: Book Series
  • Original language: English
  • DOI: 10.1007/978-3-030-33394-2_9
  • Document Type: Conference Paper
  • Volume Editors: Bykadorov I.,Strusevich V.,Tchemisova T.
  • Sponsors: Higher School of Economics,Novosibirsk State University,Russian Foundation for Basic Research,Ural Federal University
  • Publisher: Springer Science and Business Media Deutschland GmbH

  Volkov, M.V.; Institute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russian Federation;
© Copyright 2022 Elsevier B.V., All rights reserved.

Cited by 3 documents

Tu, K.-H. , Wang, H.-E. , Jiang, J.-H.R.
Homing Sequence Derivation with Quantified Boolean Satisfiability
(2022) IEEE Transactions on Computers
Shabana, H. , Volkov, M.V.
Careful synchronization of partial deterministic finite automata
(2022) Acta Informatica
Turker, U.C. , Hierons, R.M. , Mousavi, M.R.
Efficient state synchronisation in model-based testing through reinforcement learning
(2021) Proceedings - 2021 36th IEEE/ACM International Conference on Automated Software Engineering, ASE 2021
View details of all 3 citations
Inform me when this document is cited in Scopus:
Set citation alert Set citation feed
{"topic":{"name":"Automata; Primitive Digraph; Computational Complexity","id":35522,"uri":"Topic/35522","prominencePercentile":58.83696,"prominencePercentileString":"58.837","overallScholarlyOutput":0},"dig":"c22fece17b87628204ed22f713c69657f918a5711afc091c99c6a875eaffd195"}

SciVal Topic Prominence

Topic:
Prominence percentile: