<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01514669</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-21T15:07:15+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Improving Time Bounded Reachability Computations in Interactive Markov Chains</title>
            <author role="aut">
              <persName>
                <forename type="first">Hassan</forename>
                <surname>Hatefi</surname>
              </persName>
              <email type="md5">f7d2f3b8b6889bf0aded3a0a7a858786</email>
              <email type="domain">depend.cs.uni-saarland.de</email>
              <idno type="idhal" notation="numeric">1007035</idno>
              <idno type="halauthorid" notation="string">1164699-1007035</idno>
              <affiliation ref="#struct-54489"/>
              <affiliation ref="#struct-92733"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Holger</forename>
                <surname>Hermanns</surname>
              </persName>
              <email type="md5">325598aca03350ebe789dcaf9ff740cd</email>
              <email type="domain">cs.uni-saarland.de</email>
              <idno type="idhal" notation="numeric">915840</idno>
              <idno type="halauthorid" notation="string">143994-915840</idno>
              <affiliation ref="#struct-92733"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-04-26 15:22:13</date>
              <date type="whenModified">2024-12-05 14:12:05</date>
              <date type="whenReleased">2017-04-26 15:26:38</date>
              <date type="whenProduced">2013-04-24</date>
              <date type="whenEndEmbargoed">2016-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01514669v1/document">
                <date notBefore="2016-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01514669v1/file/978-3-642-40213-5_16_Chapter.pdf" id="file-1514669-1575660">
                <date notBefore="2016-01-01"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-40213-5_16.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01514669</idno>
            <idno type="halUri">https://inria.hal.science/hal-01514669</idno>
            <idno type="halBibtex">hatefi:hal-01514669</idno>
            <idno type="halRefHtml">&lt;i&gt;5th International Conference on Fundamentals of Software Engineering (FSEN)&lt;/i&gt;, Apr 2013, Tehran, Iran. pp.250-266, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-40213-5_16"&gt;&amp;#x27E8;10.1007/978-3-642-40213-5_16&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">5th International Conference on Fundamentals of Software Engineering (FSEN), Apr 2013, Tehran, Iran. pp.250-266, &amp;#x27E8;10.1007/978-3-642-40213-5_16&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1514669-1575660"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC2" corresp="IFIP-TC">IFIP TC 2: Software:Theory and Practice</idno>
            <idno type="stamp" n="IFIP-WG2-2">WG2-2: Formal Description of Programming Concepts</idno>
            <idno type="stamp" n="IFIP-FSEN">IFIP-FSEN</idno>
            <idno type="stamp" n="IFIP-LNCS-8161">Fundamentals of Software Engineering</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Improving Time Bounded Reachability Computations in Interactive Markov Chains</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Hassan</forename>
                    <surname>Hatefi</surname>
                  </persName>
                  <email type="md5">f7d2f3b8b6889bf0aded3a0a7a858786</email>
                  <email type="domain">depend.cs.uni-saarland.de</email>
                  <idno type="idhal" notation="numeric">1007035</idno>
                  <idno type="halauthorid" notation="string">1164699-1007035</idno>
                  <affiliation ref="#struct-54489"/>
                  <affiliation ref="#struct-92733"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Holger</forename>
                    <surname>Hermanns</surname>
                  </persName>
                  <email type="md5">325598aca03350ebe789dcaf9ff740cd</email>
                  <email type="domain">cs.uni-saarland.de</email>
                  <idno type="idhal" notation="numeric">915840</idno>
                  <idno type="halauthorid" notation="string">143994-915840</idno>
                  <affiliation ref="#struct-92733"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>5th International Conference on Fundamentals of Software Engineering (FSEN)</title>
                  <date type="start">2013-04-24</date>
                  <date type="end">2013-04-26</date>
                  <settlement>Tehran</settlement>
                  <country key="IR">Iran</country>
                </meeting>
                <editor>Farhad Arbab</editor>
                <editor>Marjan Sirjani</editor>
                <imprint>
                  <publisher>Springer Berlin Heidelberg</publisher>
                  <biblScope unit="serie">Fundamentals of Software Engineering</biblScope>
                  <biblScope unit="volume">LNCS-8161</biblScope>
                  <biblScope unit="pp">250-266</biblScope>
                  <date type="datePub">2013</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-40213-5_16</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Interactive Markov Chains ($\text {IMCs}$) are compositional behaviour models extending both Continuous Time Markov Chain (CTMC) and Labeled Transition System (LTS). They are used as semantic models in different engineering contexts ranging from ultramodern satellite designs to industrial system-on-chip manufacturing. Different approximation algorithms have been proposed for model checking of $\text {IMC}$, with time bounded reachability probabilities playing a pivotal role. This paper addresses the accuracy and efficiency of approximating time bounded reachability probabilities in $\text {IMC}$, improving over the state-of-the-art in both efficiency of computation and tightness of approximation. Experimental evidence is provided by applying the new method on a case study.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-54489" status="VALID">
          <orgName>Max-Planck-Institut für Informatik</orgName>
          <orgName type="acronym">MPII</orgName>
          <desc>
            <address>
              <addrLine>Campus E-1 4, 66123 Saarbrücken, Germany</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">http://www.mpi-inf.mpg.de/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-5247" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-92733" status="VALID">
          <idno type="ROR">https://ror.org/01jdpyv68</idno>
          <orgName>Universität des Saarlandes [Saarbrücken] = Saarland University [Saarbrücken]</orgName>
          <desc>
            <address>
              <addrLine>Universität des Saarlandes Campus D-66123 Saarbrücken</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">http://www.uni-saarland.de</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-5247" status="VALID">
          <orgName>Max-Planck-Gesellschaft</orgName>
          <desc>
            <address>
              <addrLine>Jägerstrasse, 10-11, D-10117 Berlin</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">https://www.mpg.de/en</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>