Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language L^* to the language L

DOI10.1007/S10559-013-9478-3MaRDI QIDQ465906zbMATH OpenOpenAlexFDO

Authors A. N. Chebotarev

Publication date 24 October 2014

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

Full work available at URL https://doi.org/10.1007/s10559-013-9478-3

zbMATH Keywords

quantifier elimination\(\exists\)-formulafictitious stateleft-infinite wordspecification language \(L^*\)synthesis of finite-state machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Recommendations

• Detecting fictitious states in a -automaton synthesized from its specification in the language LP
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II
• Improved method of synthesis of an automaton from its specification in the language \(L\)
• Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I

Cites work

• scientific article; zbMATH DE number 3254910 (Why is no real title available?)
• Approach to functional specification of automaton systems. I
• Extension of the automaton specification logical language and the synthesis problem
• On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II
• Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)

Cited in

(4)

• Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
• Detecting fictitious states in a -automaton synthesized from its specification in the language LP
• Generating FSMs from interworkings
• On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines

This page was built for publication: Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language \(L^*\) to the language \(L\)

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