Skip to main content
SpringerLink
Log in

Algebre de machines et logique temporelle

  • Contibuted Papers
  • Conference paper
  • First Online:
STACS 84 (STACS 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 166))

Included in the following conference series:

Abstract

This paper shows the relation between linear temporal logic and theory of languages of concurrent processes. To this purpose, we give an algebraic correspondence between temporal logic systems and some non deterministic sequential machines. This correspondence lies on an effective method which composes machines as temporal operators. So we can synthetise processes from temporal logic formulas and solve logic problems by algorithms applied to machines.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. A. ARNOLD et M. NIVAT: "Comportements de processus" Rapport LITP 82-12. Université de Paris VII. 1982.

    Google Scholar 

  2. M. BEN ARI, Z. MANNA, A. PNUELI: "The Temporal Logic of Branching Time". Proceedings of the Eighth ACM Symposium on Principles of Programming Languages, Williamsburg, VA, 1981.

    Google Scholar 

  3. E.M. CLARKE, E.A. EMERSON: "Design and Synthesis of synchronisation skeleton using branching time temporal logic". Proceedings of Workshop on Logics of Programs, Lecture Note in Computer Science no 131.

    Google Scholar 

  4. E.M. CLARKE, E.A. EMERSON, A.P. SISTLA: "Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications". A practical Approach". ACM 1983.

    Google Scholar 

  5. E.M. CLARKE, A.P. SISTLA: "The complexity of propositional linear temporal logics"; ACM 1982.

    Google Scholar 

  6. EILENBERG: "Automata, Languages and Machines". Vol. A. Academic Press (1974).

    Google Scholar 

  7. M. MICHEL: "Machines Algebra and Temporal Logic" (A paraître).

    Google Scholar 

  8. Z. MANNA et A. PNUELI: "Verification of concurrent Programs: The temporal framework" in the Correctness Problem in Computer Science (R.S. Boyer et J.S. Moore Eds.), International Lecture Series in C.S., AP Londres 1981.

    Google Scholar 

  9. Z. MANNA et P. WOLPER: "Synthesis of communicating processes from temporal logic specifications". Proceedings of Workshop Logics of Programs, Lecture Note in Computer Science no 131.

    Google Scholar 

  10. M. NIVAT: "Behaviours of synchronized systems of Processes", Rapport LITP 81-64. Université de Paris VII (1981).

    Google Scholar 

  11. A. PNUELI: "The Temporal Logic of Programs", Proc. 18th FOCS, Providence, RI, November 1977.

    Google Scholar 

  12. A. PNUELI: "The Temporal Semantics of Concurrent Programs", Proc. Symposium on Semantics of Concurrent Computations. Evian, France (1979). L.N.C.S. no 70.

    Google Scholar 

  13. TRAKHTENBRODT et BARZDIN: "Finite Automata" North Holland-American Elsevier (1973).

    Google Scholar 

  14. P. WOLPER: "Temporal Logic can be more expressive", Proceedings of the Twenty-Second Symposium on Foundations of Computer Science, Nashville, TN, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LCR/ENST/LITP-Paris 7, 212 Rue de Tolbiac, 75013, Paris

    Max Michel

Authors
  1. Max Michel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Fontet K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Michel, M. (1984). Algebre de machines et logique temporelle. In: Fontet, M., Mehlhorn, K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-12920-0_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12920-2

  • Online ISBN: 978-3-540-38805-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation