General method of testing the compatibility of interacting automata with finite memory

DOI10.1007/BF02742277MaRDI QIDQ1582909zbMATH OpenFDO

Authors A. N. Chebotarev

Publication date 13 May 2001

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

zbMATH Keywords

interacting partial nondeterministic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Resolution approach to testing compatibility of interacting automata
• Resolution-based approach to compatibility analysis of interacting automata
• scientific article; zbMATH DE number 3903975
• Consistency test for simple specifications of automaton systems
• On a method of analysis of generalized automata

Cites work

• Consistency test for simple specifications of automaton systems
• Interacting automata
• Resolution approach to testing compatibility of interacting automata

Cited in

(6)

• Resolution-based approach to compatibility analysis of interacting automata
• Resolution approach to testing compatibility of interacting automata
• Harmonization of automata specifications represented in the language L
• Using the compatibility analysis of logical specifications of automata to solve game problems
• Harmonization of interacting automata
• Consistency test for simple specifications of automaton systems

This page was built for publication: General method of testing the compatibility of interacting automata with finite memory

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