Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1993: CONCUR'93 pp 247–261Cite as

Model construction for implicit specifications in modal logic

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 715))

Abstract

In top-down design of reactive systems, implicit specifications of the form C(P 1, ..., Pn) sat F are often encountered, where C(P 1, ..., Pn) is a system containing the (unknown) processes P 1, ..., Pn, and F is a specification. We present a method for constructing the processes P 1, ..., Pn (as labelled transition systems) when C is given as a context of process algebra (such as CCS), and F is given as a formula of Hennessy-Milner Logic extended with maximal recursion. The main contribution is the treatment of the simultaneous construction of several processes which together act as a model for the specification. We have implemented two prototype tools (a semi-automatic as well as an automatic one) which are based on the presented theory.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. R. Andersen and G. Winskel. Compositional Checking of Satisfaction. In CAV '91, Springer LNCS 575, 1991.

    Google Scholar 

  2. E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In Logics of Programs, Springer LNCS 131, 1981.

    Google Scholar 

  3. R. Cleaveland. Tableau-Based Model Checking in the Prepositional μ-Calculus. Acta Informatica, 27, 1990.

    Google Scholar 

  4. R. Cleaveland and B. Steffen. Computing Behavioural Relations, Logically. In ICALP '91, Springer LNCS 510, 1991.

    Google Scholar 

  5. E. A. Emerson and C.-L. Lei. Efficient Model Checking in Fragments of the Prepositional μ-Calculus. In LICS '86, 1986.

    Google Scholar 

  6. M. Hennessy and R. Milner. Algebraic Laws for Nondeterminism and Concurrency. J. ACM, 1985.

    Google Scholar 

  7. O. H. Jensen, C. Jeppesen, and J. T. Lang. Model Construction for Hybrid Implicit Specifications. Master's thesis, Aalborg University, Denmark, 1993. To be available as tech. report.

    Google Scholar 

  8. B. Jonsson and K. G. Larsen. On the Complexity of Equation Solving in Process Algebra. In TAPSOFT '91, Springer LNCS 494, 1991.

    Google Scholar 

  9. D. Kozen. Results on the Prepositional μ-Calculus. In ICALP '82, Springer LNCS 140, 1982.

    Google Scholar 

  10. K. G. Larsen. Context-Dependent Bisimulation Between Processes. PhD thesis, University of Edinburgh, Scotland, 1986.

    Google Scholar 

  11. K. G. Larsen. Proof Systems for Satisfiability in Hennesy-Milner Logic With Recursion. Theoretical Comput. Sci., 72, 1990.

    Google Scholar 

  12. K. G. Larsen and X. Liu. Equation Solving Using Modal Transition Systems. In LICS '90, 1990.

    Google Scholar 

  13. K. G. Larsen and X. Liu. Compositionality Through an Operational Semantics of Contexts. J. Logic Computat., 1(6), 1991.

    Google Scholar 

  14. R. Milner. Communication and Concurrency. Prentice-Hall Int., 1989.

    Google Scholar 

  15. Z. Manna and P. Wolper. Synthesis of Communicationg Processes from Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 6(1), 1984.

    Google Scholar 

  16. R. D. Nicola and F. Vaandrager. Three Logics for Branching Bisimulation. In LICS '90, 1990.

    Google Scholar 

  17. D. Park. Concurrency and Automata on Infinite Sequences. Springer LNCS 104, 1981.

    Google Scholar 

  18. J. Parrow. Submodule Construction as Equation Solving in CCS. Theoretical Comput. Sci., 68, 1989.

    Google Scholar 

  19. H. Qin and P. Lewis. Factorization of Finite State Machines under Observational Equivalence. In CONCUR '90, Springer LNCS 458, 1990.

    Google Scholar 

  20. M. W. Shields. Implicit System Specification and the Interface Equation. The Computer Journal, 32(5), 1989.

    Google Scholar 

  21. B. Steffen. Characteristic Formulae. In ICALP '89, Springer LNCS 372, 1989.

    Google Scholar 

  22. C. Stirling and D. Walker. Local Model Checking in the Modal μ-Calculus. Theoretical Comput. Sci., 89, 1991.

    Google Scholar 

  23. G. Winskel. A Note on Model Checking the Modal ν-Calculus. In ICALP '89, Springer LNCS 372, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aalborg University, Fredrik Bajers Vej 7E, DK-9220, Aalborg, Denmark

    Ole Høgh Jensen, Christian Jeppesen, Jarl Tuxen Lang & Kim Guldstrand Larsen

Authors
  1. Ole Høgh Jensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Jeppesen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jarl Tuxen Lang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kim Guldstrand Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eike Best

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jensen, O.H., Jeppesen, C., Lang, J.T., Larsen, K.G. (1993). Model construction for implicit specifications in modal logic. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-57208-2_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57208-4

  • Online ISBN: 978-3-540-47968-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation