Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/101649
Title: Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata
Authors: Shabana, H.
Volkov, M. V.
Issue Date: 2019
Publisher: Springer Science and Business Media Deutschland GmbH
Citation: Shabana H. Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata / H. Shabana, M. V. Volkov. — DOI 10.1007/978-3-030-33394-2_9 // Communications in Computer and Information Science. — 2019. — Vol. 1090 CCIS. — P. 103-118.
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.
Keywords: CAREFUL SYNCHRONIZATION
CAREFULLY SYNCHRONIZING WORD
DETERMINISTIC AUTOMATON
NONDETERMINISTIC AUTOMATON
PARTIAL DETERMINISTIC AUTOMATON
SAT
SAT SOLVER
AUTOMATA THEORY
DECISION THEORY
MODEL CHECKING
OPERATIONS RESEARCH
OPTIMIZATION
SYNCHRONIZATION
COMPUTATIONAL RESOURCES
DETERMINISTIC AUTOMATA
NONDETERMINISTIC AUTOMATA
SAT SOLVERS
SYNCHRONIZING WORDS
ROBOTS
URI: http://hdl.handle.net/10995/101649
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 85076254945
PURE ID: 11445972
9aaf9b4b-cdd2-4ec9-9e4b-1725edee5fa8
ISSN: 18650929
ISBN: 9783030333935
DOI: 10.1007/978-3-030-33394-2_9
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85076254945.pdf193,49 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.