Skip to main content
SpringerLink
Log in

On the Expressive Power of Some Extensions of Linear Temporal Logic

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

One of the most simple models of computation suitable for representation of reactive systems behavior is a finite state transducer that operates on an input alphabet of control signals and an output alphabet of basic actions. The behavior of such a reactive system displays itself in the correspondence between the flow of control signals and sequence of basic actions performed by the system. We believe that the behavior of this kind requires more complex and expressive means of specifications than the conventional linear temporal logic (\(LTL\)). In this paper, we define a new language of formal specifications \(\mathcal{L}\mathcal{P}\)-\(LTL\), which is an extension of LTL, specifically intended for describing the properties of transducer computations. In this extension, the temporal operators are parameterized by sets of words (languages) which describe flows of control signals that impact on a reactive system. Basic predicates in the ℒ𝒫-LTL formulas are also defined by the languages in the alphabet of basic actions; these languages describe the expected response of the system to the environmental influences. In our earlier papers, we considered a verification problem for finite state transducers with regard to specifications represented by the ℒ𝒫-\(LTL\) and ℒ𝒫-\(CTL\) formulas. It was shown that the problem is algorithmically solvable for both logics. The aim of this paper is to estimate the expressive power of ℒ𝒫-\(LTL\) by comparing it with some well-known logics widely used in computer science for specification of reactive systems. Two fragments were isolated in the ℒ𝒫-LTL: ℒ𝒫-1-LTL and ℒ𝒫-n-LTL. We discovered that the specification language of ℒ𝒫-1-\(LTL\) is more expressive than LTL, while the ℒ𝒫-n-\(LTL\) fragment has the same expressive power as the monadic second order logic S1S.

Keywords:

temporal logics, expressive power, specification, verification, Büchi automata, infinite words

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. Baier, C. and Katoen, J., Principles of Model Checking, MIT Press, 2008.

    MATH  Google Scholar 

  2. Clarke, E.M., Gramberg, O., and Peled, D.A., Model Checking, MIT Press, 1999.

    Google Scholar 

  3. Etessami, K. and Wilke, T., An until hierarchy and other applications of an Ehrenfeucht-Fraisse game for temporal logic, Inf. Comput., 2000, vol. 160, no. 1, pp. 88–108.

    Article  MathSciNet  Google Scholar 

  4. Fisher, J.M. and Ladner, R.E., Propositional dynamic logic of regular programs, J. Comput. Syst. Sci., 1979, vol. 18, pp. 194–211.

    Article  MathSciNet  Google Scholar 

  5. Gabbay, D., Pnueli, A., Shelach, S., and Stavi, J., The temporal analysis of fairness, Proceedings of 7-th ACM Symposium on Principles of Programming Languages, 1980, pp. 163–173.

  6. Gnatenko, A.R. and Zakharov, V.A., On the complexity of verification of finite automata-converters over commutative semigroups, Trudy 18-1 Mezhdunarodnoi konferenii Problemy teoreticheskoi kibernetiki (Proceedings of the 18th International Conference Problems of Theoretical Cybernetics), 2017, pp. 68–70.

  7. Gnatenko, A.R. and Zakharov, V.A., On the model checking of finite state transducers over semigroups, Tr. Inst. Sist. Program. Ross. Akad. Nauk, 2018, vol. 30, no. 3, pp. 303–324.

    Google Scholar 

  8. Harel, D., Kozen, D., and Parikh, P., Process logic: Expressiveness, decidability, completeness, J. Comput. Syst. Sci., 1982, vol. 25, no. 2, pp. 144–170.

    Article  MathSciNet  Google Scholar 

  9. Henriksen, J.J. and Thiagarajan, P.S., Dynamic linear time temporal logic, Ann. Pure Appl. Logic, 1999, vol. 96, nos. 1–3, pp. 187–207.

    Article  MathSciNet  Google Scholar 

  10. Kamp, J.A.W., Tense logic and the theory of linear order, PhD Thesis, Los Angeles: University of California, 1968.

  11. Kozlova, D.G. and Zakharov, V.A., On the model checking of sequential reactive systems, Proceedings of the 25th International Workshop on Concurrency, Specification and Programming (CS&P 2016),CEUR Workshop Proceedings, 2016, vol. 1698, pp. 233–244.

    Google Scholar 

  12. Kupferman, O., Piterman, N., and Vardi, M.Y., Extended temporal logic revisited, Proceedings of 12-th International Conference on Concurrency Theory, 2001, pp. 519–535.

  13. Leucker, M. and Sanchez, C., Regular linear temporal logic, Proceedings of the 4-th International Colloquium on Theoretical Aspects of Computing, 2007, pp. 291–305.

  14. Manna, Z. and Wolper, P., Synthesis of communicating processes from temporal logic specifications, Lect. Notes Comput. Sci., 1981, vol. 131, pp. 253–281.

    Article  MathSciNet  Google Scholar 

  15. Thomas, W., Automata on infinite objects, in Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, 1990, pp. 133–192.

    Google Scholar 

  16. Vardi, M.Y. and Wolper, P., Yet another process logic, Lect. Notes Comput. Sci., 1983, vol. 14, pp. 501–512.

    MATH  Google Scholar 

  17. Vardi, M.Y. and Wolper, P., An automata-theoretic approach to automatic program verification, Proceedings of the First Symposium on Logic in Computer Science, 1986, pp. 322–331.

  18. Vardi, M.Y., A temporal fixpoint calculus, Proceedings of the 15-th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1989, pp. 250–259.

  19. Wolper, P., Temporal logic can be more expressive, Inf. Control, 1983, vol. 56, nos. 1–2, pp. 72–99.

    Article  MathSciNet  Google Scholar 

  20. Wolper, P. and Boigelot, B., Verifying systems with infinite but regular state spaces, Lect. Notes Comput. Sci., 1998, vol. 1427, pp. 88–97.

    Article  MathSciNet  Google Scholar 

  21. Zakharov, V.A., Equivalence checking problem for finite state transducers over semigroups, Lect. Notes Comput. Sci., 2015, vol. 9270, pp. 208–221.

    Article  MathSciNet  Google Scholar 

  22. Zakharov, V.A. and Temerbekova, G.G., On the minimization of finite state transducers over semigroups, Autom. Control Comput. Sci., 2017, vol. 51, no. 7, pp. 523–530.

    Article  Google Scholar 

  23. Zakharov, V.A. and Jaylauova S.R., On the minimization problem for sequential programs, Autom. Control Comput. Sci., 2017, vol. 51, no. 7, pp. 689–700.

    Article  Google Scholar 

Download references

Funding

This work was supported by the Russian Foundation for Basic Research, grant no. 18-01-00854.

Author information

Authors and Affiliations

  1. National Research University, Higher School of Economics (HSE), 101000, Moscow, Russia

    A. R. Gnatenko & V. A. Zakharov

Authors
  1. A. R. Gnatenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Zakharov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to A. R. Gnatenko or V. A. Zakharov.

Ethics declarations

The authors declare that they have no conflicts of interest.

Additional information

Translated by M. Chubarova

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gnatenko, A.R., Zakharov, V.A. On the Expressive Power of Some Extensions of Linear Temporal Logic. Aut. Control Comp. Sci. 53, 663–675 (2019). https://doi.org/10.3103/S014641161907006X

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S014641161907006X

Search

Navigation