Advertisement

Consistency checking of automata functional specifications

  • Anatoli N. Chebotarev
  • Marina K. Morokhovets
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 698)

Abstract

The use of a subset of a first order unary predicate language as a language for deterministic cyclic automata specification is considered. The formulas of the language are interpreted over the set of integers, which is regarded as a discrete time domain. An efficient algorithm for consistency checking of specifications in this language, based on modified resolution procedure, is suggested. This algorithm is implemented as a completion procedure. The use of the integers as the interpretation domain for the specification language made it possible to essentially simplify this procedure.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Church: Applications of recursive arithmetic to the problem of circuit synthesis. In: Summaries of the Summer Inst. for Symbolic Logic, Cornell University, Ithaca, New York: 1957, pp. 3–50Google Scholar
  2. 2.
    J.R. Buchi: Weak second-order arithmetic and finite automata. Zeitshr. Math. Logik und Grundl. der Math. 6, 66–92 (1960)Google Scholar
  3. 3.
    B.A. Trakhtenbrot, J.M. Barzdin: Finite automata (behaviour and synthesis) (in Russian). Moscow, USSR: Nauka 1970Google Scholar
  4. 4.
    B. Auernheimer, R.A. Kemmerer: RT-ASLAN: A specification language for real-time systems. IEEE Transactions on Software Engineering SE-12, 879–889 (1986)Google Scholar
  5. 5.
    F. Jahanian, A. Ka-Lan-Hok: Safety analysis of timing properties in realtime systems. IEEE Transactions on Software Engineering SE-12, 890–904 (1986)Google Scholar
  6. 6.
    C. Ghezzi, D. Handrioli, A. Morzenti: TRIO: A logic language for executable specifications of real-time systems. Journal of Systems and Software 12, 107–123 (1990)CrossRefGoogle Scholar
  7. 7.
    A.N. Chebotarev: On one approach to functional specification of automata systems. Cybernetics and Systems Analysis (Translated from Russian), to be appeared, 1993Google Scholar
  8. 8.
    C.L. Chang, R.C.T. Lee: Symbolic logic and mechanical theorem proving. New York-San Francisco-London: Academic press 1973Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Anatoli N. Chebotarev
    • 1
  • Marina K. Morokhovets
    • 1
  1. 1.Glushkov Institute of CyberneticsUkrainian Academy of SciencesKievUkraine

Personalised recommendations