Resolution approach to testing compatibility of interacting automata

DOI10.1007/BF02366440MaRDI QIDQ1905221zbMATH OpenOpenAlexFDO

Authors Marina K. Morokhovets, A. 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)

Recommendations

• Resolution-based approach to compatibility analysis of interacting automata
• General method of testing the compatibility of interacting automata with finite memory
• Consistency test for simple specifications of automaton systems
• Harmonization of interacting automata
• The automata-theoretic approach to verification of reactive systems

Cites work

• scientific article; zbMATH DE number 3254910 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• Approach to functional specification of automaton systems. I
• Consistency test for simple specifications of automaton systems

Cited in

(7)

• Determinization of logical specifications of automata
• Resolution-based approach to compatibility analysis of interacting automata
• Computer Algebra in Scientific Computing
• Harmonization of interacting automata
• 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}\)

This page was built for publication: Resolution approach to testing compatibility of interacting automata

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