Resolution approach to testing compatibility of interacting automata

DOI10.1007/BF02366440zbMath0837.68075OpenAlexW1971724103MaRDI QIDQ1905221

Marina K. Morokhovets, Anatoli N. Chebotarev

Publication date: 8 January 1996

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

Full work available at URL: https://doi.org/10.1007/bf02366440

zbMATH Keywords

first-order predicate logicresolution principlecompatibility analysis of automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Determinization of logical specifications of automata ⋮ Separable resolution method for checking the satisfiability of formulas in the language \({\mathfrak L}\) ⋮ General method of testing the compatibility of interacting automata with finite memory

Cites Work

• Approach to functional specification of automaton systems. I
• Consistency test for simple specifications of automaton systems
• Unnamed Item
• Unnamed Item