Advertisement

Model construction for implicit specifications in modal logic

  • Ole Høgh Jensen
  • Christian Jeppesen
  • Jarl Tuxen Lang
  • Kim Guldstrand Larsen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 715)

Abstract

In top-down design of reactive systems, implicit specifications of the form C(P1, ..., Pn) sat F are often encountered, where C(P1, ..., Pn) is a system containing the (unknown) processes P1, ..., Pn, and F is a specification. We present a method for constructing the processes P1, ..., 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AW91]
    H. R. Andersen and G. Winskel. Compositional Checking of Satisfaction. In CAV '91, Springer LNCS 575, 1991.Google Scholar
  2. [CE81]
    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. [Cle90]
    R. Cleaveland. Tableau-Based Model Checking in the Prepositional μ-Calculus. Acta Informatica, 27, 1990.Google Scholar
  4. [CS91]
    R. Cleaveland and B. Steffen. Computing Behavioural Relations, Logically. In ICALP '91, Springer LNCS 510, 1991.Google Scholar
  5. [EL86]
    E. A. Emerson and C.-L. Lei. Efficient Model Checking in Fragments of the Prepositional μ-Calculus. In LICS '86, 1986.Google Scholar
  6. [HM85]
    M. Hennessy and R. Milner. Algebraic Laws for Nondeterminism and Concurrency. J. ACM, 1985.Google Scholar
  7. [JJL93]
    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. [JL91]
    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. [Koz82]
    D. Kozen. Results on the Prepositional μ-Calculus. In ICALP '82, Springer LNCS 140, 1982.Google Scholar
  10. [Lar86]
    K. G. Larsen. Context-Dependent Bisimulation Between Processes. PhD thesis, University of Edinburgh, Scotland, 1986.Google Scholar
  11. [Lar90]
    K. G. Larsen. Proof Systems for Satisfiability in Hennesy-Milner Logic With Recursion. Theoretical Comput. Sci., 72, 1990.Google Scholar
  12. [LL90]
    K. G. Larsen and X. Liu. Equation Solving Using Modal Transition Systems. In LICS '90, 1990.Google Scholar
  13. [LL91]
    K. G. Larsen and X. Liu. Compositionality Through an Operational Semantics of Contexts. J. Logic Computat., 1(6), 1991.Google Scholar
  14. [Mil89]
    R. Milner. Communication and Concurrency. Prentice-Hall Int., 1989.Google Scholar
  15. [MW84]
    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. [NV90]
    R. D. Nicola and F. Vaandrager. Three Logics for Branching Bisimulation. In LICS '90, 1990.Google Scholar
  17. [Par81]
    D. Park. Concurrency and Automata on Infinite Sequences. Springer LNCS 104, 1981.Google Scholar
  18. [Par89]
    J. Parrow. Submodule Construction as Equation Solving in CCS. Theoretical Comput. Sci., 68, 1989.Google Scholar
  19. [QL90]
    H. Qin and P. Lewis. Factorization of Finite State Machines under Observational Equivalence. In CONCUR '90, Springer LNCS 458, 1990.Google Scholar
  20. [Shi89]
    M. W. Shields. Implicit System Specification and the Interface Equation. The Computer Journal, 32(5), 1989.Google Scholar
  21. [Ste89]
    B. Steffen. Characteristic Formulae. In ICALP '89, Springer LNCS 372, 1989.Google Scholar
  22. [SW91]
    C. Stirling and D. Walker. Local Model Checking in the Modal μ-Calculus. Theoretical Comput. Sci., 89, 1991.Google Scholar
  23. [Win89]
    G. Winskel. A Note on Model Checking the Modal ν-Calculus. In ICALP '89, Springer LNCS 372, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Ole Høgh Jensen
    • 1
  • Christian Jeppesen
    • 1
  • Jarl Tuxen Lang
    • 1
  • Kim Guldstrand Larsen
    • 1
  1. 1.Aalborg UniversityAalborgDenmark

Personalised recommendations