Modelirovanie i Analiz Informatsionnykh Sistem
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


Modelirovanie i Analiz Informatsionnykh Sistem, 2012, Volume 19, Number 2, Pages 115–137 (Mi mais224)  

Polynomial algorithm of verification for subset of PLTL logic

P. V. Lebedev

Tver State University
References:
Abstract: In this article a polynomial algorithm is described of verification of dynamic properties of Markov chains described by formulas of a subset of temporal logic PLTL (propositional temporal logic of linear time). The algorithm allows to find probability of the validity of the formula on the Markov chain, and also set of trajectories on which the verified formula is true.
Keywords: Markov chains, PLTL, temporal logics, verification of dynamic properties.
Received: 27.12.2012
Document Type: Article
UDC: 517.51+514.17
Language: Russian
Citation: P. V. Lebedev, “Polynomial algorithm of verification for subset of PLTL logic”, Model. Anal. Inform. Sist., 19:2 (2012), 115–137
Citation in format AMSBIB
\Bibitem{Leb12}
\by P.~V.~Lebedev
\paper Polynomial algorithm of verification for subset of PLTL logic
\jour Model. Anal. Inform. Sist.
\yr 2012
\vol 19
\issue 2
\pages 115--137
\mathnet{http://mi.mathnet.ru/mais224}
Linking options:
  • https://www.mathnet.ru/eng/mais224
  • https://www.mathnet.ru/eng/mais/v19/i2/p115
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Моделирование и анализ информационных систем
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024