Resolution-based approach to compatibility analysis of interacting automata
From MaRDI portal
Publication:1127549
DOI10.1016/S0304-3975(97)00025-XzbMATH Open0902.68124OpenAlexW2069373502MaRDI QIDQ1127549FDOQ1127549
Authors: A. N. Chebotarev, Marina K. Morokhovets 
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
Recommendations
- Resolution approach to testing compatibility of interacting automata
- General method of testing the compatibility of interacting automata with finite memory
- Reachability Analysis with State-Compatible Automata
- Reachability, confluence, and termination analysis with state-compatible automata
- A generalised theory of interface automata, component compatibility and error
- A generalised theory of interface automata, component compatibility and error
- Partition refinement of component interaction automata
- Harmonization of interacting automata
- On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels
- Using the compatibility analysis of logical specifications of automata to solve game problems
Cites Work
- Title not available (Why is that?)
- Interacting automata
- The existence of refinement mappings
- On Communicating Finite-State Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Specialization of Programs by Theorem Proving
- Title not available (Why is that?)
- Determinization of logical specifications of automata
- Title not available (Why is that?)
- Protocol Verification via Projections
Cited In (6)
- Richer interface automata with optimistic and pessimistic compatibility
- Resolution approach to testing compatibility of interacting automata
- On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels
- Harmonization of interacting automata
- General method of testing the compatibility of interacting automata with finite memory
- Reachability Analysis with State-Compatible Automata
This page was built for publication: Resolution-based approach to compatibility analysis of interacting automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127549)
