RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Model. Anal. Inform. Sist., 2011, Volume 18, Number 4, Pages 56–67 (Mi mais198)  

Optimization procedures in affine model checking

N. O. Garanina

A. P. Ershov Institute of Informatics Systems Sib. Br. RAS

Abstract: Symbolic model checking is based on a compact representation of sets of states and transition relations. At present there are three basic approaches of symbolic model checking: BDD-methods, bounded model checking using SAT-solvers, and various algebraic techniques, for example, constraint based model checking and regular model checking. In this paper we suggest improved algorithms for an algebraic data representation, namely, optimization algorithms for affine data structures.

Keywords: symbolic model checking, algebraic data representation, distributed systems.

Full text: PDF file (408 kB)
References: PDF file   HTML file
UDC: 517.51+514.17
Received: 18.11.2011

Citation: N. O. Garanina, “Optimization procedures in affine model checking”, Model. Anal. Inform. Sist., 18:4 (2011), 56–67

Citation in format AMSBIB
\Bibitem{Gar11}
\by N.~O.~Garanina
\paper Optimization procedures in affine model checking
\jour Model. Anal. Inform. Sist.
\yr 2011
\vol 18
\issue 4
\pages 56--67
\mathnet{http://mi.mathnet.ru/mais198}


Linking options:
  • http://mi.mathnet.ru/eng/mais198
  • http://mi.mathnet.ru/eng/mais/v18/i4/p56

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Моделирование и анализ информационных систем
    Number of views:
    This page:108
    Full text:41
    References:18

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020