Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata

DOI10.1007/s10559-017-9953-3zbMath1400.68100OpenAlexW2736762504MaRDI QIDQ1709455

Anatoli N. Chebotarev

Publication date: 5 April 2018

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

Full work available at URL: https://doi.org/10.1007/s10559-017-9953-3

zbMATH Keywords

first-order logicautomatic semanticsfuture formulapast formulasymmetric formula

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Harmonization of automata specifications represented in the language L
• Harmonization of interacting automata
• Defining liveness
• The \(\mu\)-calculus as an assertion-language for fairness arguments
• Extension of the automaton specification logical language and the synthesis problem
• Verification of reactive systems. Formal methods and algorithms.
• Topological properties of omega context-free languages

This page was built for publication: Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata