Expressive completeness of Temporal Logic of action
The paper compares the expressive power of monadic second order logic of order, a fundamental formalism in mathematical logic and theory of computation, with that of a fragment of Temporal Logic of Actions introduced by Lamport for specifying the behavior of concurrent systems.
Unable to display preview. Download preview PDF.
- 1.J. R. Büchi. On a decision method in restricted second order arithmetic In Proc. International Congress on Logic, Methodology and Philosophy of Science, E. Nagel at al. eds, Stanford University Press, pp 1–11, 1960.Google Scholar
- 2.L. Lamport. What good is temporal logic. In R. E. A. Manson editor Information Processing 83, Proceedings of IFIP 9th World Congress, Paris pp. 657–668. IFIP, North Holland.Google Scholar
- 4.Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Springer Verlag, 1992.Google Scholar
- 5.M. O. Rabin. Decidable theories. In J. Barwise editor Handbook of Mathematical Logic, North-Holland, 1977.Google Scholar
- 8.W. Thomas. Automata on Infinite Objects. In J. van Leeuwen editor Handbook of Theoretical Computer Science, The MIT Press, 1990.Google Scholar