Time and information in sequential and concurrent computation

  • Vaughan Pratt
Invited Talk 1
Part of the Lecture Notes in Computer Science book series (LNCS, volume 907)

Abstract

Time can be understood as dual to information in extant models of both sequential and concurrent computation. The basis for this duality is phase space, coordinatized by time and information, whose axes are oriented respectively horizontally and vertically. We fit various basic phenomena of computation, and of behavior in general, to the phase space perspective. The extant two-dimensional logics of sequential behavior, the van Glabbeek map of branching time and true concurrency, event-state duality and schedule-automaton duality, and Chu spaces, all fit the phase space perspective well, in every case confirming our choice of orientation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ajd37]
    K. Ajdukewicz. Die syntaktische konnexität. Studia Philosophica, I:1–27, 1937. English translation in S. McCall, Polish Logic 1920–1939, Clarendon Press, Oxford, 1967.Google Scholar
  2. [Bar91]
    M. Barr. *-Autonomous categories and linear logic. Math Structures in Comp. Sci., 1(2), 1991.Google Scholar
  3. [BG90]
    C. Brown and D. Gurr. A categorical linear framework for Petri nets. In J. Mitchell, editor, Logic in Computer Science, pages 208–218. IEEE Computer Society, June 1990.Google Scholar
  4. [BGdP91]
    C. Brown, D. Gurr, and V. de Paiva. A linear specification language for Petri nets. Technical Report DAIMI PB-363, Computer Science Department, Aarhus University, October 1991.Google Scholar
  5. [Bou90]
    G. Boudol. Computations of distributed systems, part 1: flow event structures and flow nets, 1990. Report INRIA Sophia Antipolis, in preparation.Google Scholar
  6. [BvN36]
    G. Birkhoff and J. von Neumann. The logic of quantum mechanics. Annals of Mathematics, 37:823–843, 1936.MathSciNetGoogle Scholar
  7. [dBdR72]
    J.W. de Bakker and W.P. de Roever. A calculus for recursive program schemes. In M. Nivat, editor, Automata, Languages and Programming, pages 167–196. North Holland, 1972.Google Scholar
  8. [DM60]
    A. De Morgan. On the syllogism, no. IV, and on the logic of relations. Trans. Cambridge Phil. Soc., 10:331–358, 1860.Google Scholar
  9. [dP89]
    V. de Paiva. A dialectica-like model of linear logic. In Proc. Conf. on Category Theory and Computer Science, LNCS 389, pages 341–356, Manchester, September 1989. Springer-Verlag.Google Scholar
  10. [GP93]
    V. Gupta and V.R. Pratt. Gates accept concurrent behavior. In Proc. 34th Ann. IEEE Symp. on Foundations of Comp. Sci., pages 62–71, November 1993.Google Scholar
  11. [Gra81]
    J. Grabowski. On partial languages. Fundamenta Informaticae, IV.2:427–498, 1981.Google Scholar
  12. [Gup93]
    V. Gupta. Concurrent kripke structures. In Proceedings of the North American Process Algebra Workshop, Cornell CS-TR-93-1369, August 1993.Google Scholar
  13. [Gup94]
    V. Gupta. Chu Spaces: A Model of Concurrency. PhD thesis, Stanford University, September 1994. Tech. Report, available as ftp://boole.stanford.edu/pub/gupthes.ps.Z.Google Scholar
  14. [HD73]
    P. Hitchcock and Park D. Induction rules and termination proofs. In M. Nivat, editor, Automata, Languages and Programming. North-Holland, 1973.Google Scholar
  15. [HL74]
    C.A.R. Hoare and P.E. Lauer. Consistent and complementary formal theories of the semantics of programming languages. Acta Informatica, 3:135–153, 1974.Google Scholar
  16. [Lam58]
    J. Lambek. The mathematics of sentence structure. American Math. Monthly, 65(3):154–170, 1958.Google Scholar
  17. [LS91]
    Y. Lafont and T. Streicher. Games semantics for linear logic. In Proc. 6th Annual IEEE Symp. on Logic in Computer Science, pages 43–49, Amsterdam, July 1991.Google Scholar
  18. [Maz77]
    A. Mazurkiewicz. Concurrent program schemas and their interpretation. In Proc. Aarhus Workshop on Verification of Parallel Programs, 1977.Google Scholar
  19. [Mil80]
    R. Milner. A Calculus of Communicating Systems, LNCS 92. Springer-Verlag, 1980.Google Scholar
  20. [Ng84]
    K.C. Ng. Relation Algebras with Transitive Closure. PhD thesis, University of California, Berkeley, 1984. 157+iv pp.Google Scholar
  21. [NT77]
    K.C. Ng and A. Tarski. Relation algebras with transitive closure, Abstract 742-02-09. Notices Amer. Math. Soc., 24:A29–A30, 1977.Google Scholar
  22. [Pet62]
    C.A. Petri. Fundamentals of a theory of asynchronous information flow. In Proc. IFIP Congress 62, pages 386–390, Munich, 1962. North-Holland, Amsterdam.Google Scholar
  23. [Pra76]
    V.R. Pratt. Semantical considerations on Floyd-Hoare logic. In Proc. 17th Ann. IEEE Symp. on Foundations of Comp. Sci., pages 109–121, October 1976.Google Scholar
  24. [Pra82]
    V.R. Pratt. On the composition of processes. In Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages, January 1982.Google Scholar
  25. [Pra90]
    V.R. Pratt. Action logic and pure induction. In J. van Eijck, editor, Logics in AI: European Workshop JELIA '90, LNCS 478, pages 97–120, Amsterdam, NL, September 1990. Springer-Verlag.Google Scholar
  26. [Pra92]
    V.R. Pratt. The duality of time and information. In Proc. of CONCUR '92, LNCS 630, pages 237–253, Stonybrook, New York, August 1992. Springer-Verlag.Google Scholar
  27. [Pra93a]
    V.R. Pratt. Linear logic for generalized quantum mechanics. In Proc. Workshop on Physics and Computation (PhysComp'92), pages 166–180, Dallas, 1993. IEEE.Google Scholar
  28. [Pra93b]
    V.R. Pratt. The second calculus of binary relations. In Proceedings of MFCS'93, pages 142–155, Gdańsk, Poland, 1993. Springer-Verlag.Google Scholar
  29. [Pra94a]
    V. Pratt. Chu spaces: complementarity and uncertainty in rational mechanics. Technical report, TEMPUS Summer School, Budapest, July 1994. Manuscript available as pub/bud.tex.Z by anonymous FTP from Boole.Stanford.EDU.Google Scholar
  30. [Pra94b]
    V.R. Pratt. Chu spaces: Automata with quantum aspects. In Proc. Workshop on Physics and Computation (PhysComp'94), Dallas, 1994. IEEE.Google Scholar
  31. [Pra94c]
    V.R. Pratt. A roadmap of some two-dimensional logics. In J. Van Eijck and A. Visser, editors, Logic and Information Flow (Amsterdam 1992), pages 149–162, Cambridge, MA, 1994. MIT Press.Google Scholar
  32. [WD39]
    M. Ward and R.P. Dilworth. Residuated lattices. Trans. AMS, 45:335–354, 1939.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Vaughan Pratt
    • 1
  1. 1.Stanford UniversityUSA

Personalised recommendations