Skip to main content
SpringerLink
Log in

Resolution approach to testing compatibility of interacting automata

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

Conclusion

The notion of compatibility of automata was proposed in [1] for formalization of requirements that must be met by interacting partial automata. Testing the compatibility of automata is of essential importance for the design of systems that interact with the environment, especially when we use declarative specificatio of the system to be designed. Under the assumptions of this article for the automaton that models the environment, partiality of the specified automaton is a source of possible incompatibility with the environment. When declarative specification is used, we can never decide in advance if the specified automaton is partial or not. Moreover, even a specification thata priori describes a completely defined automaton may be altered by the actions of the designer in the process of design (especially if these actions are incorrect) so that the specified automaton becomes partial. Therefore the initial specification, and each successive specification produced by human intervention in the design process, must be tested for compatibility with the environment.

In the methodology of verification design of automata, compatibility testing is used to solve two problems: a) generating the specification of the class of all automata that satisfy the initial specification and are compatible with the specification of the environment; b) testing for correctness the designer's decisions that alter the current specification of the automaton being designed.

The results of this article have led to the development of an efficient resolution procedure for testing the compatibility of automaton specification with the specification of the environment. this procedure has been implemented in the system for verification design of automata from their logical specifications. The efficiency of the developed procedure is based on the results of compatibility analysis of automata from [1] and on the restricted resolution strategy whose completeness and correctness have been proved in [2].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. N. Chebotarev, “Automaton interaction,” Kibern. Sistem. Anal., No. 6, 17–29 (1991).

    MATH  MathSciNet  Google Scholar 

  2. A. N. Chebotarev, “Consistency testing of simple specifications of automaton systems,” Kibern. Sistem. Anal., No. 3, 3–11 (1994).

    MATH  MathSciNet  Google Scholar 

  3. A. N. Chebotarev, “An approach to functional specification of automaton systems,” Kibern. Sistem. Anal., No. 3, 31–42 (1993).

    MATH  Google Scholar 

  4. A. Gill, An Introduction to the Theory of Finite Automata [Russian translation], Nauka, Moscow (1966).

    Google Scholar 

  5. C.-L. Chang and R. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York (1973).

    Google Scholar 

Download references

Authors
  1. M. K. Morokhovets
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. N. Chebotarev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 36–50, November–December, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Morokhovets, M.K., Chebotarev, A.N. Resolution approach to testing compatibility of interacting automata. Cybern Syst Anal 30, 820–829 (1994). https://doi.org/10.1007/BF02366440

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02366440

Keywords

Search

Navigation