Model Checking for combined logics

F We consider combined model checking procedures for the three ways of combining logics: temporalizations, independent combinations, and the join. We present results on computational complexity and report on experiments with implementations. We also discuss the relevance to time granular logics.

[1]  Edith Hemaspaandra.  Complexity transfer for modal logic , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[2]  Joseph Y. Halpern,et al.  Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.

[3]  Angelo Montanari,et al.  Decidable Theories of ω-Layered Metric Temporal Structures , 2000 .

[4]  F. J. Pelletier,et al.  316 Notre Dame Journal of Formal Logic , 1982 .

[5]  M. de Rijke,et al.  Special Issue on Combining Logics - Editor's Introduction , 1996, Notre Dame J. Formal Log..

[6]  Marcus Kracht,et al.  Properties of independently axiomatizable bimodal logics , 1991, Journal of Symbolic Logic.

[7]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[8]  Dov M. Gabbay,et al.  Combining Temporal Logic Systems , 1996, Notre Dame J. Formal Log..

[9]  Angelo Montanari,et al.  Decidability Results for Metric and Layered Temporal Logics , 1996, Notre Dame J. Formal Log..

[10]  Dov M. Gabbay,et al.  Products of Modal Logics, Part 1 , 1998, Log. J. IGPL.

[11]  Dov M. Gabbay,et al.  Adding a temporal dimension to a logic system , 1992, J. Log. Lang. Inf..

[12]  Branching within Time , 2000 .