Improved method of synthesis of an automaton from its specification in the language L

DOI10.1007/S10559-011-9316-4zbMATH Open1298.68178OpenAlexW2004495646MaRDI QIDQ464896FDOQ464896

V. G. Timofeyev, A. N. Chebotarev

Publication date: 30 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-011-9316-4

zbMATH Keywords

normal formdisjunctive formorthogonalization of disjunctive formssplitting factorsynthesis of automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
• Approach to functional specification of automaton systems. I

Cited In (6)

• Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)
• Synthesis of a nondeterministic automaton from its logical specification. I
• Automaton synthesis from a nonformal specification
• Compositional approach to the development of reactive algorithms
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
• Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic

This page was built for publication: Improved method of synthesis of an automaton from its specification in the language \(L\)

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