José Carmo
Skip Abstract Section
Abstract
Abstract
A brief overview is given of the temporal logics used in concurrent program verification and in database and systems specification. The properties of the underlying modal frame structures are analysed. The relative advantages of the linear and branching approaches are discussed. The state versus path formulas controversy is revisited. A meta-linear operatorL is proposed and compared with the “in all trajectories” operator considered in the language CTL*. The usefulness of the new operator within the context of a layered methodology for database and information systems specification and verification is illustrated. The operator is seen as a “frame change operator” and other interesting operators of this class are referred. Finitary and infinitary axiomatisations are given for the operatorL. The proof of the completeness of the infinitary axiomatisation is briefly outlined. This proof requires an appropriate extension of the usual Henkin methods.
- [All83] Maintaining Temporal Knowledge about Temporal IntervalsComm. ACM19832611Google Scholar
Digital Library
- [BMP81] Ben-Ari, M., Manna, Z. and Pnueli, A.: The Temporal Logic of Branching Time.Proc. 8th Annual Symposium on Principles of Programming Languages, ACM, pp. 164–175, 1981.Google Scholar
- [Ben82] The Logic of Time1982DordrechtD. Reidel Publishing CompanyGoogle Scholar
- [Boo79] Boolos, G.:The Unprovability of Consistency. An Essay in Modal Logic, Cambridge University Press, 1979.Google Scholar
- [Bub77] Bubenko, J.: The Temporal Dimension in Information Processing. In:Architecture and Models in Database Management, G. Nijssen, (ed.), North-Holland, 1977.Google Scholar
- [Bur78] The Unreal FutureTheoria1978XLIV157174Google Scholar
- [Car85] Carmo, J.: The Infolog Branching Logic of Events. In:Theoretical and Formal Aspects of Information Systems 1985, A. Sernadas, J. Bubenko, and A. Olivé (eds), North-Holland, pp. 159–174, 1985.Google Scholar
- [Car88] Carmo, J.:Lógicas Temporais para a Especificação e Verificação de Sistemas de Informação, Ph.D. thesis, IST (the Lisbon Institute of Technology, Technical University of Lisbon), 1988.Google Scholar
- [CaS88a] Carmo, J. and Sernadas, A.: A Temporal Logic Framework for a Layered Approach to Systems Specification and Verification. In:Temporal Aspects in Information Systems, C. Rolland, F. Bodard and M. Leonard (eds), North-Holland, pp. 31–46, 1988.Google Scholar
- [CaS88b] Formal Techniques for Systems Specification and Verificationinternal report1988LisbonIST/INESCGoogle Scholar
- [CaS89a] Carmo, J. and Sernadas, A.: Inevitability in Branching Time. In:Logic at Botik '89, A. R. Mayer and M. A. Taitslin (eds), LNCS 363 Springer-Verlag, pp. 41–62, 1989.Google Scholar
- [CaS89b] Carmo, J. and Sernadas, A.: A Completeness Result in a Mixed Branching-Linear Logic, to appear in the proceedings of theLogic Colloquium in Memory of Hugo Ribeiro (Lisbon), 1989.Google Scholar
- [CaF82] Casanova, M. A. and Furtado, A. L.: On the Description of Database Transition Constraints Using Temporal Languages.Proc. 2nd Workshop for Logical Basis for Data Bases, pp. 211–236, 1982.Google Scholar
- [CCF82] Castilho, J. M. V., Casanova, M. A. and Furtado, A. L.: A Temporal Framework for Information Systems Specification.Proc. 8th VLDB Conference, pp. 280–291, 1982.Google Scholar
- [Che80] Chellas, B. F.:Modal Logic: An Introduction, Cambridge University Press, 1980.Google Scholar
- [ClE81] Clarke, E. M. and Emerson, E. A.: Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic.Proc. Workshop on Logic of Programs, LNCS 131, Springer-Verlag, pp. 52–71, 1981.Google Scholar
- [CGK89] Clarke, E. M., Grumberg, O. and Kurshan, R. P.: A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems. In:Logic at Botik '89, A. R. Mayer and M. A. Taitslin (eds), LNCS 363, Springer-Verlag, pp. 81–90, 1989.Google Scholar
- [Dij75] Guarded Commands, Nondeterminacy and Formal Derivation of ProgramsComm. ACM197518845345710.1145/360933.360975Google ScholarDigital Library
- [ESS88] Ehrich, H.-D., Sernadas, A. and Sernadas, C.: Abstract Object Types for Databases. In:Advances in Object-Oriented Database Systems, Dittrich (ed.), Springer-Verlag, pp. 144–149, 1988.Google Scholar
- [Eme83] Alternative Semantics for Temporal LogicsTheor. Comput. Sci.198326121130Google ScholarCross Ref
- [EmH82] Emerson, E.A. and Halpern, J.Y.: Decision Procedures and Expressiveness in the Temporal Logic of Branching Time.Proc. 14th Annual ACM Symposium on Theory of Computing, ACM, pp. 169–180, 1982 (first version) andJournal of Comput. and Syst. Sciences,30, 1–24 (1985) (second version).Google Scholar
- [EmH86] “Sometimes” and “Not Never” Revisited: On Branching versus Linear Time Temporal LogicJournal ACM1986331151178Google ScholarDigital Library
- [End72] Enderton, B.:A Mathematical Introduction to Logic, Academic Press, 1972.Google Scholar
- [Fia89] Fiadeiro, J.:Cálculo de Objectos e Eventas, Ph.D. Thesis, IST (the Lisbon Institute of Technology, Technical University of Lisbon), 1989.Google Scholar
- [FiS86] The Infolog Linear Tense Propositional Logic of Events and TransactionsInformation Systems19861116185Google ScholarDigital Library
- [FiS88] Specification and Verification of Database DynamicsActa Informatica198825625661Google ScholarDigital Library
- [FiL79] Propositional Dynamic Logic of Regular ProgramsJournal of Comput. and Syst. Sciences197918194211Google ScholarCross Ref
- [FuN86] Furtado, A. L. and Neuhold, E. J.:Formal Technics for Data Base Design, Springer-Verlag, 1986.Google Scholar
- [Gab72] Tense Systems with Discrete Moments of Time: Part IJournal of Philosophical Logic197213544Google ScholarCross Ref
- [GPS80] Gabbay, D. M., Pnueli, A., Shelah, S. and Stavi, J.: On the Temporal Analysis of Fairness.Proc. 7th Annual ACM Symposium on Principles of Programming Languages, ACM, pp. 163–173, 1980.Google Scholar
- [Gol82] Goldblatt, R.:Axiomatizing the Logic of Computer Programming, LNCS 137, Springer-Verlag, 1982.Google Scholar
- [GMS83] Golshani, F., Maibaum, T. and Sadler, M.: A Modal System of Algebras for Database Specification and Query/Update Language Support.Proc. 9th VLDB Conference, pp. 331–339, 1983.Google Scholar
- [Har79] Harel, D.:First-Order Dynamic Logic, LNCS 68, Springer-Verlag, 1979.Google Scholar
- [HKP82] Harel, D., Kozen, D. and Parikh, R.: Process Logic: Expressiveness, Decidability, Completeness.Journal of Comput and Syst. Sciences, 144–170 (1982).Google Scholar
- [Hoa69] An Axiomatic Basis for Computer ProgrammingComm. ACM19691257658010.1145/363235.363259Google ScholarDigital Library
- [HuC68] Hughes, G. E. and Cresswell, M. J.:An Introduction to Modal Logic, Methuen and Co., 1968.Google Scholar
- [HuC84] Hughes, G. E. and Cresswell, M. J.:A Companion to Modal Logic, Methuen and Co., 1984.Google Scholar
- [Kam68] On Tense Logic and the Theory of Linear OrderPh. D. thesis1968Los AngelesUniversity of CaliforniaGoogle Scholar
- [Kun84] Kung, C.:A Temporal Framework for Information Systems Specification and Verification, Ph. D. thesis, Norwegian Institute of Technology, 1984.Google Scholar
- [Kun85] Kung, C.: A Tableaux Approach for Consistency Checking. In:Theoretical and Formal Aspects of Information Systems 1985, A. Sernadas, J. Bubenko and A. Olivé (eds), North-Holland, pp. 191–207, 1985.Google Scholar
- [Lam80] Lamport, L.: “Sometime” is Sometimes “Not Never” on the Temporal Logic of Programs.Proc. 7th Annual ACM Symposium on Principles of Programming Languages, ACM, pp. 174–185, 1980.Google Scholar
- [LeS82] “Reasoning with Time and ChanceInformation and Control198253165198Google ScholarCross Ref
- [LPZ85] Lichtenstein, O., Pnueli, A. and Zuck, L.: The Glory of the Past. In:Logics of Programs, R. Parikh, (ed.), LNCS 193, Springer-Verlag, pp. 196–218, 1985.Google Scholar
- [Lip88] Lipeck, U. W.: Transformation of Dynamic Integrity Constraints into Transaction Specifications.Proc. Int. Conf. on Database Theory 1988, LNCS, Springer-Verlag 1988.Google Scholar
- [LEG85] Lipeck, U. W., Ehrich, H. D. and Gogolla, M.: Specifying Admissibility of Dynamic Database Behaviour Using Temporal Logic. In:Theoretical and Formal Aspects of Information Systems 1985, A. Sernadas, J. Bubenko and A. Olivé (eds), North-Holland, pp. 145–157, 1985.Google Scholar
- [MKJ86] Maibaum, T. S. E., Khosla, S. and Jeremaes, P.: A Modal (Action) Logic for Requirements Specification. In:IEE Computing Series 6, D. Barnes and P. Brown (eds), Peter Peregrinus, 1986.Google Scholar
- [MaP81] Manna, Z. and Pnueli, A.: Verification of Concurrent Programs: the Temporal Framework. In:The Correctness Problem in Computer Science, R. Boyer and J. Moore (eds), ILCS, Academic Press, pp. 215–273, 1981.Google Scholar
- [MaP83] Manna, Z. and Pnueli, A.: Proving Precedence Properties: the Temporal Way.Automata Languages and Programming, 10th Colloquium, LNCS 154, Springer-Verlag, pp. 491–512, 1983.Google Scholar
- [McA76] McArthur, R. P.:Tense Logic, D. Reidel Publishing Company, 1976.Google Scholar
- [McC79] The Strong Future TenseNotre Dame Journal of Formal Logic1979XX3489504Google Scholar
- [NPW80] Petri Nets, Event Structures, and Domains, Part ITheoretical Computer Science198013185108Google ScholarCross Ref
- [Nis80] Descriptively Complete Process LogicActa Informatica1980144359369Google ScholarDigital Library
- [OwL82] Proving Liveness Properties of Concurrent ProgramsACM TOPLAS198243455495Google ScholarDigital Library
- [Pnu77] Pnueli, A.: The Temporal Logic of Programs.Proc. 18th Annual ACM Symposium on Foundations of Computer Science, IEEE, pp. 45–57, 1977.Google Scholar
- [Pnu79] Pnueli, A.: The Temporal Semantics of Concurrent Programs. In:Semantics of Concurrent Computation, G. Kahn (ed.), LNCS 70, Springer-Verlag, pp. 1–20, 1979.Google Scholar
- [Pnu86] Pnueli, A.: Specification and Development of Reactive Systems. In:Information Processing 86, H. J. Kugler, (ed.), pp. 845–858, IFIP, 1986.Google Scholar
- [Pra76] Pratt, V. R.: Semantical Considerations on Floyd-Hoare Logic.Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, pp. 109–121, 1976.Google Scholar
- [Pra87] Modelling Concurrency with Partial OrdersInternationaljournal of Parallel Programming19871513371Google Scholar
- [Pri67] Prior, A.:Past, Present and Future, Oxford, 1967.Google Scholar
- [Rei88] Concurrency is More Fundamental than InterleavingEATCS Bulletin198835181185Google Scholar
- [ReU71] Rescher, N. and Urquhart, A.:Temporal Logic, Springer-Verlag, 1971.Google Scholar
- [RLR79] Rolland, C., Leifert, S. and Richard, C: Tools for Information Systems Dynamics Management.Proc. 5th VLDB Conference, 1979.Google Scholar
- [Sch85] Schiel, U.: The Time Dimension in Information Systems. In:Theoretical and Formal Aspects of Information Systems, A. Sernadas, J. Bubenko and A. Olivé (eds), North-Holland, pp. 67–75, 1985.Google Scholar
- [Ser80] Temporal Aspects of Logical Procedure DefinitionInformation Systems19805216718710.1016/0306-4379(80)90009-5Google Scholar
- [SeS83] Sernadas, A. and Sernadas, C.: Infolog: an Integrated Model of Data and Processes, INFOLOG RR05, IFIP WG 8.1 Meeting, York, 1983.Google Scholar
- [SeS85] Sernadas, A. and Sernadas, C.: Capturing Knowledge About the Organization Dynamics. In:Knowledge Representation for DDS, L. B. Methlie and R. Sprague (eds), North-Holland, 1985.Google Scholar
- [SCS82] Sernadas, A., Carmo, J. and Sernadas, C.: Software Behavior Specification with Triggering Logic, INFOLOG RR02, Faculty of Sciences, Lisbon, 1982.Google Scholar
- [SEC89] From Processes to Objectsinternal report1989LisbonIST/INESCGoogle Scholar
- [SSE87] Sernadas, A., Sernadas, C. and Ehrich, H.-D.: Object-Oriented Specification of Databases: An Algebraic Approach. In:Proc. 13th Conference on Very Large Data Bases, P. Hammersley (ed.), 1987.Google Scholar
- [SFS88] Sernadas, A., Fiadeiro, J., Sernadas, C. and Ehrich, H.-D.: Abstract Object Types: A Temporal Perspective. In:Colloquium on Temporal Logic and Specification, A. Pnueli, H. Barringer and B. Banieqbal (eds), Springer-Verlag (to be published).Google Scholar
- [Sti87] Stirling, C.: Comparing Linear and Branching Time Temporal Logics, to appear inProc. Alvey Colloquium on Temporal Logics, Springer-Verlag, 1987.Google Scholar
- [Tho70] Indeterministic Time and Truth-Value GapsTheoria197036264281Google ScholarCross Ref
- [VeF85] Veloso, P. and Furtado, A.L.: Towards Simpler and Yet Complete Formal Specifications. In:Theoretical and Formal Aspects of Information Systems 1985, A. Sernadas, J. Bubenko and A. Olivé (eds), North-Holland, pp. 175–189, 1985.Google Scholar
- [Ven88] Venema, Y. de: Expressiveness and Completeness of an Interval Tense Logic, ITLI Prepublication Series 88-02, Institute for Language, Logic and Information, University of Amsterdam, 1988.Google Scholar
- [Zan89] Zanardo, A.: A Complete Deductive System for Since-Until Branching-Time Logic,internal report, Dipartimento di Matematica Pura ed Applicata, Universita' Degli Studi di Padova, 1989.Google Scholar
Index Terms
- Branching versus linear logics yet again
Index terms have been assigned to the content through auto-classification.
Recommendations
Linear and affine logics with temporal, spatial and epistemic operators
A temporal spatial epistemic intuitionistic linear logic (TSEILL) is introduced, and the completeness theorem for this logic is proved with respect to Kripke semantics. TSEILL has three temporal modal operators: [F] (any time in the future), [N] (next ...
Fibring Non-Truth-Functional Logics: Completeness Preservation
Fibring has been shown to be useful for combining logics endowed with truth-functional semantics. However, the techniques used so far are unable to cope with fibring of logics endowed with non-truth-functional semantics as, for example, paraconsistent ...
Completeness of Flat Coalgebraic Fixpoint Logics
Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The μ-calculus and its relatives are among the most expressive logics of this type. However, popular fixpoint logics ...
Comments