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.
This work was supported by ONR under grant number N00014-92-J-1974
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
M. Barr. *-Autonomous categories and linear logic. Math Structures in Comp. Sci., 1(2), 1991.
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.
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.
G. Boudol. Computations of distributed systems, part 1: flow event structures and flow nets, 1990. Report INRIA Sophia Antipolis, in preparation.
G. Birkhoff and J. von Neumann. The logic of quantum mechanics. Annals of Mathematics, 37:823–843, 1936.
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.
A. De Morgan. On the syllogism, no. IV, and on the logic of relations. Trans. Cambridge Phil. Soc., 10:331–358, 1860.
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.
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.
J. Grabowski. On partial languages. Fundamenta Informaticae, IV.2:427–498, 1981.
V. Gupta. Concurrent kripke structures. In Proceedings of the North American Process Algebra Workshop, Cornell CS-TR-93-1369, August 1993.
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.
P. Hitchcock and Park D. Induction rules and termination proofs. In M. Nivat, editor, Automata, Languages and Programming. North-Holland, 1973.
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.
J. Lambek. The mathematics of sentence structure. American Math. Monthly, 65(3):154–170, 1958.
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.
A. Mazurkiewicz. Concurrent program schemas and their interpretation. In Proc. Aarhus Workshop on Verification of Parallel Programs, 1977.
R. Milner. A Calculus of Communicating Systems, LNCS 92. Springer-Verlag, 1980.
K.C. Ng. Relation Algebras with Transitive Closure. PhD thesis, University of California, Berkeley, 1984. 157+iv pp.
K.C. Ng and A. Tarski. Relation algebras with transitive closure, Abstract 742-02-09. Notices Amer. Math. Soc., 24:A29–A30, 1977.
C.A. Petri. Fundamentals of a theory of asynchronous information flow. In Proc. IFIP Congress 62, pages 386–390, Munich, 1962. North-Holland, Amsterdam.
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.
V.R. Pratt. On the composition of processes. In Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages, January 1982.
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.
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.
V.R. Pratt. Linear logic for generalized quantum mechanics. In Proc. Workshop on Physics and Computation (PhysComp'92), pages 166–180, Dallas, 1993. IEEE.
V.R. Pratt. The second calculus of binary relations. In Proceedings of MFCS'93, pages 142–155, Gdańsk, Poland, 1993. Springer-Verlag.
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.
V.R. Pratt. Chu spaces: Automata with quantum aspects. In Proc. Workshop on Physics and Computation (PhysComp'94), Dallas, 1994. IEEE.
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.
M. Ward and R.P. Dilworth. Residuated lattices. Trans. AMS, 45:335–354, 1939.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pratt, V. (1995). Time and information in sequential and concurrent computation. In: Ito, T., Yonezawa, A. (eds) Theory and Practice of Parallel Programming. TPPP 1994. Lecture Notes in Computer Science, vol 907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026562
Download citation
DOI: https://doi.org/10.1007/BFb0026562
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59172-6
Online ISBN: 978-3-540-49218-4
eBook Packages: Springer Book Archive