• DocumentCode
    3631289
  • Title

    Exploiting partitioned transition relations for efficient symbolic model checking in CTL

  • Author

    A. Casar;Z. Brezocnik;T. Kapus

  • Author_Institution
    Maribor Univ., Slovenia
  • fYear
    1996
  • Firstpage
    606
  • Abstract
    We present an efficient tool for symbolic state space traversal of finite state machines. Both algorithms for searching reachable states and for model checking in CTL owe their efficiency primarily to the use of partitioned transition relations. Partitioning of the relations is fully automatic.
  • Keywords
    "Binary decision diagrams","State-space methods","Partitioning algorithms","Boolean functions","Data structures","Central Processing Unit","Circuit testing","Automata","Heuristic algorithms","Software packages"
  • Publisher
    ieee
  • Conference_Titel
    European Design and Test Conference, 1996. ED&TC 96. Proceedings
  • ISSN
    1066-1409
  • Print_ISBN
    0-8186-7424-5
  • Type

    conf

  • DOI
    10.1109/EDTC.1996.494370
  • Filename
    494370
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3631289