Process semantics of temporal logic specification

  • J. L. Fiadeiro
  • J. F. Costa
  • A. Sernadas
  • T. S. E. Maibaum
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 655)

Abstract

A process semantics for temporal logic specification is provided by relating a category of temporal theories and interpretations between theories where specification configuration and interconnection is achieved via colimits of diagrams, and a category of algebraic models of processes where parallel composition is explained in terms of limits of diagrams. This semantics is proved to be exact in the sense that given a diagram in the categories of theories and a model of it as a diagram in the category of processes, the limit of the process diagram is a model of the colimit of the theory diagram. In fact, any denotation of a system of interconnected specifications corresponds to a configuration of their denotations as a system of interconnected processes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Barringer 87]
    H.Barringer, “The Use of Temporal Logic in the Compositional Specification of Concurrent Systems”, in A.Galton (ed) Temporal Logics and their Applications, Academic Press 1987Google Scholar
  2. [Costa and Sernadas 91]
    J.-F.Costa and A.Sernadas, “Process Models within a Categorial Framework”, Research Report, INESC 1990Google Scholar
  3. [Diaconescu et al 91]
    R.Diaconescu, J.Goguen and P.Stefaneas, Logical Support for Modularisation, Research Report, PRG Oxford University 1991Google Scholar
  4. [Ehrich et al 90]
    H.-D.Ehrich, J.Goguen and A.Sernadas, “A Categorial Theory of Objects as Observed Processes”, in J.deBakker, W.deRoever and G.Rozenberg (eds) Foundations of Object-Oriented Languages, LNCS 489, Springer Verlag 1991, 203–228Google Scholar
  5. [Fiadeiro and Maibaum 91a]
    J.Fiadeiro and T.Maibaum, “Describing, Structuring, and Implementing Objects”, in J.deBakker, W.deRoever and G.Rozenberg (eds) Foundations of Object-Oriented Languages, LNCS 489, Springer Verlag 1991, 274–310Google Scholar
  6. [Fiadeiro and Maibaum 91b]
    J.Fiadeiro and T.Maibaum, “Temporal Theories as Modularisation Units for Concurrent System Specification”, to appear in Formal Aspects of Computing Google Scholar
  7. [Fiadeiro et al 91]
    J.Fiadeiro, J.-F.Costa, A.Sernadas and T.Maibaum, Process Semantics of Temporal Logic Specification — extended version, INESC Research Report 1991Google Scholar
  8. [Goguen 89]
    J.Goguen, A Categorical Manifesto, Technical Report PRG-72, Programming Research Group, University of Oxford, March 1989Google Scholar
  9. [Goguen 91]
    J.Goguen, “Sheaf Semantics of Concurrent Interacting Objects”, to appear in Mathematical Structures in Computer Science Google Scholar
  10. [Goguen and Burstall 84]
    J.Goguen and R.Burstall, “Introducing Institutions”, in E.Clarke and D.Kozen (eds) Logics of Programming Workshop, LNCS 164, Springer-Verlag 1984, 221–256Google Scholar
  11. [Goguen and Ginali 78]
    J.Goguen and S.Ginali, “A Categorical Approach to General Systems Theory”, in G.Klir (ed) Applied General Systems Research, Plenum 1978, 257–270Google Scholar
  12. [Goguen and Meseguer 82]
    J.Goguen and J.Meseguer, “Universal Realisation, Persistence Interconnection and Implementation of Abstract Modules”, in M.Nielsen and E.Schmidt (eds) Proc. 9th International Conference on Automata, Languages and Programming, LNCS 140, Springer Verlag 1982, 265–281Google Scholar
  13. [Goldblatt 87]
    R.Goldblatt, Logics of Time and Computation, Centre for the Study of Language and Information 1987Google Scholar
  14. [Jonsson 85]
    BJonsson, “A Model and Proof System for Asynchronous Networks”, in Proceedings of the 4th Annual ACM Symposium on Principles on Distributed Computing, Minaki, Canada, 1985Google Scholar
  15. [Manna and Pnueli 81]
    Z.Manna and A.Pnueli, “Verification of Concurrent Programs: The Temporal Framework”, in R.Boyer and J.Moore (eds) The Correctness Problem in Computer Science, Academic Press 1981, 215–273Google Scholar
  16. [Meseguer 89]
    J.Meseguer, “General Logics”, in H.-D.Ebbinghaus et al (eds) Logic Colloquium 87, North-Holland 1989Google Scholar
  17. [Misra 84]
    J.Misra, “Reasoning about Networks of Communicating Processes”, in INRIA Advanced Nato Study Institute on Logics and Models for Verification and Specification of Concurrent Systems, Nice, France, Reidel 1984Google Scholar
  18. [Olderog 91]
    E.-R.Olderog, Nets Terms and Formulas, Cambridge Tracts in Theoretical Computer Science 23, Cambridge University Press 1991Google Scholar
  19. [Pnueli 77]
    A.Pnueli, “The Temporal Logic of Programs”, in Proc 18th Annual Symposium on Foundations of Computer Science, IEEE 1977, 45–57Google Scholar
  20. [Sannella and Tarlecki 85]
    D.Sannella and A.Tarlecki, “Building Specifications in an Arbitrary Institution”, in Proc. Int. Sym on the Semantics of Data Types, LNCS 173, Springer Verlag 1985. Extended version in Information and Control 76, 1988, 165–210Google Scholar
  21. [Sernadas and Enrich 91]
    A.Sernadas and H.-D.Ehrich, “What is an Object, After All”, in R.Meersman, W.Kent and S.Khosla (eds), Object-oriented Databases: Analysis, Design and Construction, North-Holland 1991, 39–69Google Scholar
  22. [Sernadas et al 90]
    A.Sernadas, H.-D.Ehrich and J.-F.Costa, “From Processes to Objects”, The INESC Journal of Research and Development 1(1) 1990, 7–27Google Scholar
  23. [Winskel 84]
    G.Winskel, “Synchronisation Trees”, Theoretical Computer Science 34, 1984Google Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • J. L. Fiadeiro
    • 1
  • J. F. Costa
    • 1
  • A. Sernadas
    • 1
  • T. S. E. Maibaum
    • 2
  1. 1.INESC & Dept. MatemáticaISTLisboa, CodexPortugal
  2. 2.Dept. ComputingImperial College of Science, Technology and MedicineLondonUK

Personalised recommendations