Resolution-based approach to compatibility analysis of interacting automata

DOI10.1016/S0304-3975(97)00025-XzbMath0902.68124OpenAlexW2069373502MaRDI QIDQ1127549

Marina K. Morokhovets, Anatoli N. Chebotarev

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00025-x

zbMATH Keywords

compatibility analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• The existence of refinement mappings
• Interacting automata
• Determinization of logical specifications of automata
• Protocol Verification via Projections
• On Communicating Finite-State Machines
• The Specialization of Programs by Theorem Proving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item