Consistency test for simple specifications of automaton systems

DOI10.1007/BF02366466zbMath0836.68067MaRDI QIDQ1905143

Anatoli N. Chebotarev

Publication date: 22 April 1996

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

zbMATH Keywords

consistency checkingautomata specification

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Verifying specifications in the language L against temporal properties nonexpressible in this language ⋮ Harmonization of automata specifications represented in the language L ⋮ Resolution approach to testing compatibility of interacting automata ⋮ Determinization of logical specifications of automata ⋮ Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I ⋮ Synthesis of a nondeterministic automaton from its logical specification. II ⋮ General method of testing the compatibility of interacting automata with finite memory

Cites Work

• Unnamed Item
• On an approach to functional specification of automata systems. II
• On an approach to functional specification of automata systems. III
• Approach to functional specification of automaton systems. I

This page was built for publication: Consistency test for simple specifications of automaton systems