Skip to main content
SpringerLink
Log in

MetateM: An introduction

  • Published:
Formal Aspects of Computing

Abstract

In this paper a methodology for the use of temporal logic as an executable imperative language is introduced. The approach, which provides a concrete framework, calledMetateM, for executing temporal formulae, is motivated and illustrated through examples. In addition, this introduction provides references to further, more detailed, work relating to theMetateM approach to executable logics.

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. Allen, J.: Towards a general theory of action and time.Artificial Intelligence, 23(2):123–154, 1984.

    Article  MATH  Google Scholar 

  2. Abadi, M. and Manna, Z.: Temporal Logic Programming.Journal of Symbolic Computation, 8: 277–295, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  3. Baudinet, M.: Temporal Logic Programming is Complete and Expressive. InProceedings of Sixteenth ACM Symposium on Principles of Programming Languages (POPL), Austin, Texas, January 1989. ACM.

    Book  Google Scholar 

  4. Baudinet, M.: A Simple Proof of the Completeness of Temporal Logic Programming. In L Fariñas del Cerro and M. Penttonen, editors,Intensional Logics for Programming. Oxford University Press, 1992.

  5. Barringer, H., Fisher, M., Gabbay, D., Gough, G. and Owens, R.:MetateM: A Framework for Programming in Temporal Logic. InProceedings of REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, Mook, Netherlands, June 1989. (Published inLecture Notes in Computer Science, volume 430, Springer Verlag).

  6. Barringer, H., Fisher, M., Gabbay, D., Gough, G. and Owens, R.:MetateM: An Imperative Approach to Temporal Logic Programming.Formal Aspects of Computing, 7(E) pp. 111–155.

  7. Barringer, H., Fisher, M. and Gough, G.: Fair SMG and Linear Time Model Checking. InProceedings of Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, June 1989. (Published inLecture Notes in Computer Science, volume 407, Springer-Verlag).

  8. Barringer, H., Fisher, M., Gabbay, D. and Hunter, A.: Meta-Reasoning in Executable Temporal Logic. In J. Allen, R. Fikes, and E. Sandewall, editors,Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), Cambridge, Massachusetts, April 1991. Morgan Kaufmann.

    Google Scholar 

  9. Barringer, H. and Gabbay, D.: Executing temporal logic: Review and prospects (Extended Abstract). InProceedings of Concurrency '88, 1988.

  10. Brzoska, C.: Temporal Logic Programming with Metric and Past Operators. In M. Fisher and R. Owens, editors,Executable Modal and Temporal Logics, volume 897 ofLecture Notes in Artificial Intelligence. Springer-Verlag, Hiedelberg, Germany, 1995.

    Google Scholar 

  11. Emerson, E. A. and Clarke, E. M.: Using Branching Time Temporal Logic to Synthesise Synchronisation Skeletons.Science of Computer Programming, 2:241–266, 1982.

    Article  MATH  Google Scholar 

  12. Fisher, M. and Barringer, H.: ConcurrentMetateM Processes — A Language for Distributed AI. InProceedings of the European Simulation Multiconference, Copenhagen, Denmark, June 1991.

  13. Finger, M., Fisher, M. and Owens, R.:MetateM at Work: Modelling Reactive Systems Using Executable Temporal Logic. InSixth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE), Edinburgh, U.K., June 1993. Gordon and Breach Publishers.

    Google Scholar 

  14. Fisher, M.: A Normal Form for First-Order Temporal Formulae. InProceedings of Eleventh International Conference on Automated Deduction (CADE), Saratoga Springs, New York, June 1992. (Published inLecture Notes in Computer Science, volume 607, Springer-Verlag).

  15. Fisher, M.: ConcurrentMetateM — A Language for Modeling Reactive Systems. InParallel Architectures and Languages, Europe (PARLE), Munich, Germany, June 1993. Springer-Verlag.

    Google Scholar 

  16. Fisher, M.: A Survey of ConcurrentMetateM — The Language and its Applications. InFirst International Conference on Temporal Logic (ICTL), Bonn, Germany, July 1994. (Published inLecture Notes in Computer Science, volume 827, Springer-Verlag).

  17. Fujita, M., Kono, S., Tanaka, T. and Moto-oka, T.: Tokio: Logic Programming Language based on Temporal Logic and its compilation into Prolog. In3rd International Conference on Logic Programming, London, July 1986. (Published inLecture Notes in Computer Science, volume 225, Springer-Verlag).

  18. Finger, M., McBrien, P. and Owens, R.: Databases and Executable Temporal Logic. InProceedings of the ESPRIT Conference, November 1991.

  19. Fisher, M. and Noël, P.: Transformation and Synthesis inMetateM — Part I: PrepositionalMetateM. Technical Report UMCS-92-2-1, Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, U.K., February 1992.

    Google Scholar 

  20. Fisher, M. and Owens, R.: From the Past to the Future: Executing Temporal Logic Programs. InProceedings of Logic Programming and Automated Reasoning (LPAR), St. Petersberg, Russia, July 1992. (Published inLecture Notes in Computer Science, volume 624, Springer-Verlag).

  21. Fisher, M. and Owens, R.: An Introduction to Executable Modal And Temporal Logics. In M. Fisher and R. Owens, editors,Executable Modal and Temporal Logics, volume 897 ofLecture Notes in Artificial Intelligence. Springer-Verlag, Hiedelberg, Germany, 1995.

    Chapter  Google Scholar 

  22. Fisher, M. and Owens, M.: editors.Executable Modal and Temporal Logics, volume 897 ofLecture Notes in Artificial Intelligence. Springer-Verlag, February 1995.

  23. Frühwirth, T.: Temporal Logic and Annotated Constraint Logic Programming. In M. Fisher and R. Owens, editors,Executable Modal and Temporal Logics, volume 897 ofLecture Notes in Artificial Intelligence. Springer-Verlag, Hiedelberg, Germany, 1995.

    Google Scholar 

  24. Fisher, M. and Wooldridge, M.: Executable Temporal Logic for Distributed A.I. InTwelfth International Workshop on Distributed A.I., Hidden Valley Resort, Pennsylvania, May 1993.

  25. Gabbay, D.: Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In B. Banieqbal, H. Barringer, and A. Pnueli, editors,Proceedings of Colloquium on Temporal Logic in Specification, Altrincham, U.K., 1987. (Published inLecture Notes in Computer Science, volume 398, Springer-Verlag).

  26. Gabbay, D.: Modal and Temporal Logic II (A Temporal Prolog Machine). In T. Dodd, R. Owens, and S. Torrance, editors,Logic Programming—Expanding the Horizon. Intellect Books Ltd, 1991.

  27. Gough, G. D.: Decision Procedures for Temporal Logic. Master's thesis, Department of Computer Science, University of Manchester, October 1984.

  28. Hale, R.: Temporal Logic Programming. In A. Galton, editor,Temporal Logics and their Applications, chapter 3, pages 91–119. Academic Press, London, December 1987.

    Google Scholar 

  29. Hale, R. and Moszkowski, B.: Parallel Programming in Temporal Logic. InParallel Architectures and Languages Europe (PARLE), Eindhoven, The Netherlands, June 1987. (Published as Lecture Notes in Computer Science, volume 259, Springer Verlag, Berlin.).

    Google Scholar 

  30. Hrycej, T.: Temporal Prolog. In Yves Kodratoff, editor,Proceedings of the European Conference on Artificial Intelligence (ECAI). Pitman Publishing, August 1988.

  31. Hrycej, T.: A temporal extension of Prolog.The Journal of Logic Programming, 15(1 & 2):113–145, January 1993.

    Article  MATH  MathSciNet  Google Scholar 

  32. Jaffir, J. and Lassez, J-L.: Constraint Logic Programming. InProceedings of the Fourteenth ACM Symposium on the Principles of Programming Languages, pages 111–119, Munich, West Germany, January 1987.

  33. Lichtenstein, O., Pnueli, A. and Zuck, L.: The Glory of the Past.Lecture Notes in Computer Science, 193:196–218, June 1985.

    Article  MathSciNet  Google Scholar 

  34. Merz, S.: Efficiently Executable Temporal Logic Programs. In M. Fisher and R. Owens, editors,Executable Modal and Temporal Logics, volume 897 ofLecture Notes in Artificial Intelligence. Springer-Verlag, Hiedelberg, Germany, 1995.

    Google Scholar 

  35. Moszkowski, B.: Reasoning about digital circuits. Technical report, Stanford University, 1983.

  36. Moszkowski, B.:Executing Temporal Logic Programs. Cambridge University Press, Cambridge, UK, 1986.

    Google Scholar 

  37. Manna, Z. and Wolper, P.: Synthesis of communicating processes from temporal logic specifications.ACM Transactions on Programming Languages and Systems, 6(1), January 1984.

  38. Noël, P.: A Method for the Determinisation of Propositional Temporal Formulae. In T. Clement and K. Lau, editors,Proceedings of Workshop on Logic Program Synthesis and Transformation (LOPSTR), Manchester, UK, July 1991. Springer-Verlag.

    Google Scholar 

  39. Orgun, M. and Ma, W.: An Overview of Temporal and Modal Logic Programming. InFirst International Conference on Temporal Logic (ICTL), Bonn, Germany, July 1994. (Published inLecture Notes in Computer Science, volume 827, Springer-Verlag).

  40. Orgun, M. and Wadge, W.: Theory and Practice of Temporal Logic Programming. In L Fariñas del Cerro and M. Penttonen, editors,Intensional Logics for Programming. Oxford University Press, 1992.

  41. Orgun, M. and Wadge, W.: Towards a unified theory of intensional logic programming.The Journal of Logic Programming, 13(1, 2, 3 and 4):413–440, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  42. Pnueli, A. and Rosner, R.: On the Synthesis of a Reactive Module. InProceedings of the Sixteenth ACM Symposium on the Principles of Programming Languages (POPL), pages 179–190, 1989.

  43. Pnueli, A. and Rosner, R.: On the Synthesis of an Asynchronous Reactive Module. InProceedings of the Sixteenth International Colloquium on Automata, Languages and Programs (ICALP), 1989.

  44. Tang, T.: Temporal Logic CTL + Prolog.Journal of Automated Reasoning, 5:49–65, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  45. Torsun, I. S. and Manning, K. J.: Execution and Application of Temporal Modal Logic. Internal Report, Department of Computing, University of Bradford, U.K., 1990. (Part of the Alvey final report on the Logic Database Demonstrator Project).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Manchester, Manchester

    H. Barringer & G. Gough

  2. Department of Computing, Manchester Metropolitan University, Chester Street, M 5GD, Manchester, UK

    M. Fisher

  3. Department of Computing, Imperial College of Science, Technology and Medicine, London

    D. Gabbay

  4. Nomura Research Institute Europe Ltd., London

    R. Owens

Authors
  1. H. Barringer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Fisher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Gabbay
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. G. Gough
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. R. Owens
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Fisher.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Barringer, H., Fisher, M., Gabbay, D. et al. MetateM: An introduction. Formal Aspects of Computing 7, 533–549 (1995). https://doi.org/10.1007/BF01211631

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation