Approach to functional specification of automaton systems. I
From MaRDI portal
Cites work
Cited in
(12)- Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
- Verifying specifications in the language L against temporal properties nonexpressible in this language
- Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II
- Solving inequalities over finite state machines in the reactive systems design
- Improved method of synthesis of an automaton from its specification in the language \(L\)
- Resolution approach to testing compatibility of interacting automata
- Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language L^* to the language L
- scientific article; zbMATH DE number 7301749 (Why is no real title available?)
- 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
- On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
- Consistency test for simple specifications of automaton systems
This page was built for publication: Approach to functional specification of automaton systems. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895045)
