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

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

Authors 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)

Recommendations

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

Cites work

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

Cited in

(12)

• Improved resolution-based method for satisfiability checking formulas of the language \(L\)
• Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language \(L^*\) to the language \(L\)
• Compositional approach to the development of reactive algorithms
• scientific article; zbMATH DE number 3892553 (Why is no real title available?)
• scientific article; zbMATH DE number 3924147 (Why is no real title available?)
• Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)
• scientific article; zbMATH DE number 3880600 (Why is no real title available?)
• Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
• Transformation synthesis of efficient algorithms with auxiliary specifications
• Synthesis of a nondeterministic automaton from its logical specification. I
• Automaton synthesis from a nonformal specification

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)