Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic

DOI10.1007/S10559-017-9969-8zbMath1380.68271OpenAlexW2757040240MaRDI QIDQ681718

Anatoli N. Chebotarev

Publication date: 13 February 2018

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

Full work available at URL: https://doi.org/10.1007/s10559-017-9969-8

zbMATH Keywords

first-order logicspecification\(\Sigma\)-automatonautomatic semanticsLF formulaLP formulaspecification theorem

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF ⋮ Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP

Cites Work

• Unnamed Item
• Unnamed Item
• Harmonization of automata specifications represented in the language L
• Harmonization of interacting automata
• Recognizing safety and liveness
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
• Extension of the automaton specification logical language and the synthesis problem
• Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata
• Deterministic generators and games for Ltl fragments
• Tools and Algorithms for the Construction and Analysis of Systems
• Verification, Model Checking, and Abstract Interpretation
• Topological properties of omega context-free languages

This page was built for publication: Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic