Filters








4 Hits in 1.1 sec

SWITSS: Computing Small Witnessing Subsystems [article]

Simon Jantsch, Hans Harder, Florian Funke, Christel Baier
<span title="2020-08-10">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present SWITSS, a tool for the computation of Small WITnessing SubSystems. SWITSS implements exact and heuristic approaches based on reducing the problem to (mixed integer) linear programming.  ...  Returned subsystems can automatically be rendered graphically and are accompanied with a certificate which proves that the subsystem is indeed a witness.  ...  SWITSS can also compute minimal witnessing subsystems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2008.04049v1">arXiv:2008.04049v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6bwert5vwng7dha5nlb7bog3jm">fatcat:6bwert5vwng7dha5nlb7bog3jm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200812054818/https://arxiv.org/pdf/2008.04049v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2008.04049v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

SWITSS: Computing Small Witnessing Subsystems [article]

Simon Jantsch, Hans Harder, Florian Funke, Christel Baier, Alexander Ivrii, Ofer Strichman
<span title="2020-09-11">2020</span>
We present SWITSS, a tool for the computation of Small WITnessing SubSystems. SWITSS implements exact and heuristic approaches based on reducing the problem to (mixed integer) linear programming.  ...  Returned subsystems can automatically be rendered graphically and are accompanied with a certificate which proves that the subsystem is indeed a witness.  ...  SWITSS can also compute minimal witnessing subsystems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_31">doi:10.34727/2020/isbn.978-3-85448-042-6_31</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/67lrmtpbkrfq5chnocunvtvi54">fatcat:67lrmtpbkrfq5chnocunvtvi54</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200920011839/https://repositum.tuwien.at/bitstream/20.500.12708/15527/1/31_SWITSS%20Computing%20Small%20Witnessing%20Subsystems.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_31"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Witnessing Subsystems for Probabilistic Systems with Low Tree Width

Simon Jantsch, Jakob Piribauer, Christel Baier
<span title="2021-09-16">2021</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
Furthermore, an algorithm which aims to utilise a given directed tree partition of the system to compute a minimal witnessing subsystem is described.  ...  Computing minimal witnessing subsystems is NP-hard already for acyclic Markov chains, but can be done in polynomial time for Markov chains whose underlying graph is a tree.  ...  Computing minimal witnessing subsystems in terms of number of states is computationally difficult.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.346.3">doi:10.4204/eptcs.346.3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ubd6scfhdjbxhpdiypms3evqii">fatcat:ubd6scfhdjbxhpdiypms3evqii</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210921032229/https://arxiv.org/pdf/2109.08326v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b1/82/b182a5a1cf44441c81ff032d6578a1d07ebde768.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.346.3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Witnessing subsystems for probabilistic systems with low tree width [article]

Simon Jantsch, Jakob Piribauer, Christel Baier
<span title="2021-08-18">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Furthermore, an algorithm which aims to utilise a given directed tree partition of the system to compute a minimal witnessing subsystem is described.  ...  Computing minimal witnessing subsystems is NP-hard already for acyclic Markov chains, but can be done in polynomial time for Markov chains whose underlying graph is a tree.  ...  Computing minimal witnessing subsystems in terms of number of states is computationally difficult.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.08070v1">arXiv:2108.08070v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3uwe4jxcfve73lwzn3mw4sttca">fatcat:3uwe4jxcfve73lwzn3mw4sttca</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210829135532/https://arxiv.org/pdf/2108.08070v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/72/60/726011b5c01843098fbad48443b21baae04e5040.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.08070v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>