Skip to main content
SpringerLink
Log in

Model Checking for Combined Logics with an Application to Mobile Systems

  • Published:
Automated Software Engineering Aims and scope Submit manuscript

Abstract

In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are terminating, sound, and complete, we analyze their computational complexity, and we report on experiments with implementations. We take a close look at mobile systems and show how the proposed combined model checking framework can be successfully applied to the specification and verification of their properties.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Areces, C., Blackburn, P., and Marx, M. 1999. A road-map on complexity for hybrid logics. In J. Flum and M. Rodriguez-Artalejo, editors, Proc.of the Annual Conference of the European Association for Computer Science Logic,vol. 1683 of LNCS, Springer, pp. 307–321.

  • Areces, C., Blackburn, P., and Marx, M. 2000. The computational complexity of hybrid temporal logics. Logic Journal of the IGPL, 8(5):653–679.

    Google Scholar 

  • Areces, C., Blackburn, P., and Marx, M. 2001. Hybrid logics: Characterization, interpolation, and complexity. Journal of Symbolic Logic, 66(3):977–1010.

    Google Scholar 

  • Baader, F. and Ohlbach, H. 1995. A multidimensional terminological knowledge representation language. Applied NonClassical Logic, 5:153–197.

    Google Scholar 

  • Blackburn, P. 2000. Representation, reasoning, and relational structures: A hybrid logic manifesto. Logic Journal of the IGPL, 8(3):339–365.

    Google Scholar 

  • Blackburn, P. and de Rijke, M. (eds.) 1996. Special Issue on Combining Structures, Logics, and Theories. Notre Dame Journal of Formal Logic, 37:161–380.

  • Cardelli, L. 1999. Abstractions for mobile computations. In J. Vitek and C. Jensen editors, Secure Internet Programming: Security Issues for Mobile and Distributed Objects,vol. 1603 of LNCS, Springer, pp. 51–94.

  • Cardelli, L. and Gordon, A.D. 2000a. Anytime, anywhere: Modal logics for mobile ambients. In Proc.of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, Massachusetts, 19–21, pp. 365–377.

    Google Scholar 

  • Cardelli, L. and Gordon, A.D. 2000b. Mobile ambients. Theoretical Computer Science, 240(1):177–213.

    Google Scholar 

  • Charatonik, W., Dal Zilio, S., Gordon, A.D., Mukhopadhyay, S., and Talbot, J.-M. 2001. The complexity of model checking mobile ambients. In F. Honsell and M. Miculan, editors, Proc.of the International Conference on Foundations of Software Science and Computation Structures,vol. 2030 of LNCS, Springer, pp. 52–167.

  • Charatonik, W. and Talbot, J.-M. 2001. The decidability of model checking mobile ambients. In Proc.of the 15th Annual Conference of the European Association for Computer Science Logic, Springer, pp. 339–354.

  • Clarke, E., Emerson, E.A., and Sistla, A.P. 1986. Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263.

    Google Scholar 

  • Clarke, E.M., Grumberg, O., and Peled, D.A. 1999.Model Checking. Cambridge MA: The MIT Press.

    Google Scholar 

  • Clarke, E.M. and Schlingloff, H. 2001. Model checking. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning,vol. II, Elsevier Science, chap. 24, pp. 1635–1790.

  • Emerson, E.A. 1990. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, Elsevier Science Publishers B.V., pp. 995–1072.

  • Engelfriet, J. 1996. Minimal temporal epistemic logic. Notre Dame Journal of Formal Logic, 37:233–259.

    Google Scholar 

  • Fagin, R., Halpern, J.Y., Moses, Y., and Vardi, M.Y. 1995. Reasoning about Knowledge. Cambridge, MA: MIT Press.

    Google Scholar 

  • Fine, K. and Schurz, G. 1996. Transfer theorems for multimodal logics. In J. Copeland, editor, Logic and Reality: Essays on the Legacy of Arthur Prior, Oxford, Oxford University Press, pp. 169–213.

    Google Scholar 

  • Finger, M. 1992. Handling database updates in two-dimensional temporal logic. Journal of Applied Non-Classical Logics, 2(2):201–224.

    Google Scholar 

  • Finger, M. 1994. Changing the Past: Database Applications of Two-Dimensional Executable Temporal Logics. PhD thesis, Imperial College, Department of Computing.

  • Finger, M. and Gabbay, D.M. 1992. Adding a temporal dimension to a logic system. Journal of Logic Language and Information, 1:203–233.

    Google Scholar 

  • Finger, M. and Gabbay, D.M. 1996. Combining temporal logic systems. Notre Dame Journal of Formal Logic, 37:204–232.

    Google Scholar 

  • Finger, M. and Reynolds, M. 2000. Two-dimensional executable temporal logic for bitemporal databases. In Advances in Temporal Logic, Kluver Academic Publishers, pp. 393–411.

  • Franceschet, M. and de Rijke, M. 2003. Model checking for hybrid logics. In Proceedings of the 3rd International Workshop on Methods for Modalities (M4M), pp. 109–123.

  • Franceschet, M., de Rijke, M., and Schlingloff, H. 2003. Hybrid logics on linear structures: Expressivity and complexity. In Proc.of the 10th International Symposium on Temporal Representation and Reasoning and of the 4th International Conference on Temporal Logic (TIME-ICTL). IEEE Computer Society Press.

  • Franceschet, M., Montanari, A., and de Rijke, M. 2000. Model checking for combined logics. In Proc.of the 3rd International Conference on Temporal Logic, pp. 65–73.

  • Gabbay, D., Kurucz, A., Wolter, F., and Zakharyaschev, M. 2003. Many-Dimensional Modal Logics: Theory and Applications. Elsevier.

  • Gabbay, D.M. and de Rijke M. (eds.) 2000. Frontiers of Combining Systems 2,vol.7 of Studies in Logic and Computation. Research Studies Press/ Wiley.

    Google Scholar 

  • Gabbay, D.M. and Shehtman, V. 1998. Products of modal logics, part I. Logic Journal of the IGPL, 6:73–146.

    Google Scholar 

  • Goguen, J.A. and Burstall, R.M. 1992. Institutions: Abstract model theory for specification and programming. Journal of the ACM, 39:95–147.

    Google Scholar 

  • Halpern, J.Y. and Vardi, M.Y. 1989. The complexity of reasoning about knowledge and time I: Lower bounds. Journal of Computer and System Sciences, 38(1):195–237.

    Google Scholar 

  • Halpern, J.H. and Vardi, M.Y. 1991. Model checking vs. theorem proving: A manifesto. In Proc.of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, pp. 325–334.

  • Hemaspaandra, E. 1994. Complexity transfer for modal logic. In Proc.of the 9th Symposium on Logic in Computer Science, Los Alamitos, CA., USA: pp. 164–175. IEEE Computer Society Press. HyLo: The Hybrid Logic home page. URL: http://www.hylo.net.

  • Jones, C.B. 1983. Specification and design of (parallel) programs. In IFIP World Computer Congress, pp. 321–332.

  • Kracht, M. and Wolter, F. 1991. Properties of independently axiomatizable bimodal logics. Journal of Symbolic Logic, 56(4):1469–1485.

    Google Scholar 

  • Kupferman, O. and Vardi, M.Y. 1998. Modular model checking. In Compositionality: The Significant Difference.International Symposium, COMPOS97,volume 1536 of LNCS, Springer, pp. 381–401.

    Google Scholar 

  • Kupferman, O. and Vardi, M.Y. 2000. An automata-theoretic approach to modular model checking. ACM Transactions on Programming Languages and Systems, 22:87–128.

    Google Scholar 

  • Kurucz, A. 2000. S5 3 lacks the finite model property. In Proc.of the 3rd International Conference on Temporal Logic (ICTL).

  • Lamport, L. 1983. Specifying concurrent program modules. ACM Transaction on Programming Language and Systems, 5:190–222.

    Google Scholar 

  • Manna, Z. and Pnueli, A. 1992. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer.

  • Marx, M. 1999. Complexity of products of modal logics. Journal of Logic and Computation, 9:221–238.

    Google Scholar 

  • Meyer, J. and van der Hoek, W. 1995. Epistemic Logic for AI and Computer Science. Cambridge University Press.

  • Pnueli, A. 1977. The temporal logic of programs. In Proceedings IEEE Symposium of Foundations of Computer Science, pp. 46–77.

  • Sernadas, A., Sernadas, C., and Caleiro, C. 1997. Synchronization of logics with mixed rules: Completeness preservation. In M. Johnson, editor, Algebraic Methodology and Software Technology—AMAST97,vol. 1349 of LNCS, Springer, pp. 465–478.

  • Spaan, E. 1993. Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam.

  • Wolter, F. 1995. The finite model property in tense logic. The Journal of Symbolic Logic, 60(3):757–774.

    Google Scholar 

  • Wolter, F. 1996. A counterexample in tense logic. Notre Dame Journal of Formal Logic, 37(2):167–173.

    Google Scholar 

  • Wolter, F. 1997. Completeness and decidability of tense logics closely related to logics above K4. The Journal of Symbolic Logic, 62(1):131–158.

    Google Scholar 

  • Wolter, F. 1998. Fusions of modal logics revisited. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic. CSLI, Stanford, CA.

    Google Scholar 

  • Wolter, F. 2000. The product of converse PDL and polymodal K. Journal of Logic and Computation, 10(2):223–251.

    Google Scholar 

  • Wolter, F. and Zakharyaschev, M. 1998. Satisfiability problem in description logics with modal operators. In Proc.of the 6th Conference on Principles of Knowledge Representation and Reasoning,Morgan Kaufmann, pp. 512–523.

Download references

Author information

Authors and Affiliations

  1. Department of Sciences, University of Chieti-Pescara, Italy

    Massimo Franceschet

  2. Department of Mathematics and Computer Science, University of Udine, Italy

    Angelo Montanari

  3. Institute for Logic, Language, and Computation, University of Amsterdam, The Netherlands

    Maarten de Rijke

Authors
  1. Massimo Franceschet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Angelo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maarten de Rijke
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Franceschet, M., Montanari, A. & de Rijke, M. Model Checking for Combined Logics with an Application to Mobile Systems. Automated Software Engineering 11, 289–321 (2004). https://doi.org/10.1023/B:AUSE.0000028537.84347.9c

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AUSE.0000028537.84347.9c

Search

Navigation