Harmonization of automata specifications represented in the language L
DOI10.1007/S10559-016-9834-1zbMATH Open1392.68215OpenAlexW2398590839MaRDI QIDQ334231FDOQ334231
Publication date: 1 November 2016
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-016-9834-1
Recommendations
- Extension of the automaton specification logical language and the synthesis problem
- Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
- Harmonization of interacting automata
- Determinization of logical specifications of automata
- Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
automaton specificationcomposition correctnesscomposition of specificationsharmonization of specificationslanguage L
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- General method of testing the compatibility of interacting automata with finite memory
- Consistency test for simple specifications of automaton systems
- Separable resolution method for checking the satisfiability of formulas in the language \({\mathfrak L}\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Harmonization of interacting automata
Cited In (3)
This page was built for publication: Harmonization of automata specifications represented in the language L
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334231)