<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">inf19408</article-id><article-id pub-id-type="doi">10.15388/Informatica.2008.232</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Termination of Derivations in a Fragment of Transitive Distributed Knowledge Logic</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Pliuškevičius</surname><given-names>Regimantas</given-names></name><email xlink:href="mailto:regis@ktl.mii.lt">regis@ktl.mii.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><contrib contrib-type="Author"><name><surname>Pliuškevičienė</surname><given-names>Aida</given-names></name><email xlink:href="mailto:aida@ktl.mii.lt">aida@ktl.mii.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Institute of Mathematics and Informatics, Akademijos 4, LT-08663 Vilnius, Lithuania</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>2008</year></pub-date><volume>19</volume><issue>4</issue><fpage>597</fpage><lpage>616</lpage><history><date date-type="received"><day>01</day><month>02</month><year>2008</year></date><date date-type="accepted"><day>01</day><month>06</month><year>2008</year></date></history><abstract><p>
A transitive distributed knowledge logic is considered. The considered logic S4<inf>n</inf>D is obtained from multi-modal logic S4<inf>n</inf> by adding transitive distributed knowledge operator. For a fragment of this logic loop-check-free sequent calculus is proposed. The considered fragment is such that it can be applied for specification and verification of safety properties of knowledge-based distributed systems. By relying on the constructed loop-check-free sequent calculus a PSPACE procedure to determine a termination of backward derivation in considered fragment of the logic S4<inf>n</inf>D is presented.
</p></abstract><kwd-group><label>Keywords</label><kwd>logic of knowledge</kwd><kwd>distributed knowledge</kwd><kwd>safety and liveness properties of distributed systems</kwd><kwd>deduction-based decision procedure</kwd><kwd>sequent calculus</kwd><kwd>loop-check</kwd><kwd>backtracking</kwd><kwd>PSPACE-complexity</kwd></kwd-group></article-meta></front></article>