Filters








637 Hits in 1.9 sec

Minimal witnesses for probabilistic timed automata [article]

Simon Jantsch, Florian Funke, Christel Baier
<span title="2020-07-01">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Witnessing subsystems have proven to be a useful concept in the analysis of probabilistic systems, for example as diagnostic information on why a given property holds or as input to refinement algorithms. This paper introduces witnessing subsystems for reachability problems in probabilistic timed automata (PTA). Using a new operation on difference bounds matrices, it is shown how Farkas certificates of finite-state bisimulation quotients of a PTA can be translated into witnessing subsystems. We
more &raquo; ... present algorithms for the computation of minimal witnessing subsystems under three notions of minimality, which capture the timed behavior from different perspectives, and discuss their complexity.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.00637v1">arXiv:2007.00637v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6i2mhwaqnjgnpbixh46s3bwyne">fatcat:6i2mhwaqnjgnpbixh46s3bwyne</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200710052715/https://arxiv.org/pdf/2007.00637v1.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/2007.00637v1" 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
<span title="2020-08-10">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Witnessing subsystems for probabilistic reachability thresholds in discrete Markovian models are an important concept both as diagnostic information on why a property holds, and as input to refinement algorithms. 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
more &raquo; ... rtificate which proves that the subsystem is indeed a witness.
<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>

Causality-Based Game Solving [article]

Christel Baier, Norine Coenen, Bernd Finkbeiner, Florian Funke, Simon Jantsch, Julian Siber
<span title="2021-05-29">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a causality-based algorithm for solving two-player reachability games represented by logical constraints. These games are a useful formalism to model a wide array of problems arising, e.g., in program synthesis. Our technique for solving these games is based on the notion of subgoals, which are slices of the game that the reachability player necessarily needs to pass through in order to reach the goal. We use Craig interpolation to identify these necessary sets of moves and
more &raquo; ... y slice the game along these subgoals. Our approach allows us to infer winning strategies that are structured along the subgoals. If the game is won by the reachability player, this is a strategy that progresses through the subgoals towards the final goal; if the game is won by the safety player, it is a permissive strategy that completely avoids a single subgoal. We evaluate our prototype implementation on a range of different games. On multiple benchmark families, our prototype scales dramatically better than previously available tools.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.14247v1">arXiv:2105.14247v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qbwvkddqgzgwniwpbonxxhd3wu">fatcat:qbwvkddqgzgwniwpbonxxhd3wu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210602072556/https://arxiv.org/pdf/2105.14247v1.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/34/3d/343dd378ee065692a4199dbbffcd7ff0938c9d26.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.14247v1" 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>

Determinization and Limit-determinization of Emerson-Lei automata [article]

Tobias John, Simon Jantsch, Christel Baier, Sascha Klüppelholz
<span title="2021-06-30">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study the problem of determinizing ω-automata whose acceptance condition is defined on the transitions using Boolean formulas, also known as transition-based Emerson-Lei automata (TELA). The standard approach to determinize TELA first constructs an equivalent generalized Büchi automaton (GBA), which is later determinized. We introduce three new ways of translating TELA to GBA. Furthermore, we give a new determinization construction which determinizes several GBA separately and combines them
more &raquo; ... sing a product construction. An experimental evaluation shows that the product approach is competitive when compared with state-of-the-art determinization procedures. We also study limit-determinization of TELA and show that this can be done with a single-exponential blow-up, in contrast to the known double-exponential lower-bound for determinization. Finally, one version of the limit-determinization procedure yields good-for-MDP automata which can be used for quantitative probabilistic model checking.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2106.15892v1">arXiv:2106.15892v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rgx7n2ba6rbmvalnmyiktf5rxu">fatcat:rgx7n2ba6rbmvalnmyiktf5rxu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210702014801/https://arxiv.org/pdf/2106.15892v1.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/6c/f4/6cf4326e2335ef17fe82768e96d66cf8844d1bfe.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2106.15892v1" 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>

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>
A standard way of justifying that a certain probabilistic property holds in a system is to provide a witnessing subsystem (also called critical subsystem) for the property. 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. This paper considers the problem for probabilistic systems that are similar to trees or paths. It introduces the parameters directed tree-partition width
more &raquo; ... (dtpw) and directed path-partition width (dppw) and shows that computing minimal witnesses remains NP-hard for Markov chains with bounded dppw (and hence also for Markov chains with bounded dtpw). By observing that graphs of bounded dtpw have bounded width with respect to all known tree similarity measures for directed graphs, the hardness result carries over to these other tree similarity measures. Technically, the reduction proceeds via the conceptually simpler matrix-pair chain problem, which is introduced and shown to be NP-complete for nonnegative matrices of fixed dimension. Furthermore, an algorithm which aims to utilise a given directed tree partition of the system to compute a minimal witnessing subsystem is described. It enumerates partial subsystems for the blocks of the partition along the tree order, and keeps only necessary ones. A preliminary experimental analysis shows that it outperforms other approaches on certain benchmarks which have directed tree partitions of small width.
<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>

Reachability in Dynamical Systems with Rounding [article]

Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland
<span title="2020-09-28">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We consider reachability in dynamical systems with discrete linear updates, but with fixed digital precision, i.e., such that values of the system are rounded at each step. Given a matrix M ∈ℚ^d × d, an initial vector x∈ℚ^d, a granularity g∈ℚ_+ and a rounding operation [·] projecting a vector of ℚ^d onto another vector whose every entry is a multiple of g, we are interested in the behaviour of the orbit 𝒪=<[x], [M[x]],[M[M[x]]],...>, i.e., the trajectory of a linear dynamical system in which
more &raquo; ... state is rounded after each step. For arbitrary rounding functions with bounded effect, we show that the complexity of deciding point-to-point reachability—whether a given target y ∈ℚ^d belongs to 𝒪—is PSPACE-complete for hyperbolic systems (when no eigenvalue of M has modulus one). We also establish decidability without any restrictions on eigenvalues for several natural classes of rounding functions.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2009.13353v1">arXiv:2009.13353v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xbogzzin65hsjhsxlnyw4ifgpa">fatcat:xbogzzin65hsjhsxlnyw4ifgpa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200930011601/https://arxiv.org/pdf/2009.13353v1.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/2009.13353v1" 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>

From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating Automata [article]

Simon Jantsch and David Müller and Christel Baier and Joachim Klein
<span title="2019-07-05">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Simon Jantsch et al.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.02887v1">arXiv:1907.02887v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ziqqezuqsnhhhf6rtp7ox2j7be">fatcat:ziqqezuqsnhhhf6rtp7ox2j7be</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200825193745/https://arxiv.org/pdf/1907.02887v1.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/81/a0/81a09a7fec6ec5ff37acf2953d950533c8afd850.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.02887v1" 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>

Farkas certificates and minimal witnesses for probabilistic reachability constraints [article]

Florian Funke, Simon Jantsch, Christel Baier
<span title="2020-02-05">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper introduces Farkas certificates for lower and upper bounds on minimal and maximal reachability probabilities in Markov decision processes (MDP), which we derive using an MDP-variant of Farkas' Lemma. The set of all such certificates is shown to form a polytope whose points correspond to witnessing subsystems of the model and the property. Using this correspondence we can translate the problem of finding minimal witnesses to the problem of finding vertices with a maximal number of
more &raquo; ... . While computing such vertices is computationally hard in general, we derive new heuristics from our formulations that exhibit competitive performance compared to state-of-the-art techniques. As an argument that asymptotically better algorithms cannot be hoped for, we show that the decision version of finding minimal witnesses is NP-complete even for acyclic Markov chains.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1910.10636v2">arXiv:1910.10636v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vnjjvropcbdznoptcri5fgkzpa">fatcat:vnjjvropcbdznoptcri5fgkzpa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321132354/https://arxiv.org/pdf/1910.10636v2.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/1910.10636v2" 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>

Responsibility and verification: Importance value in temporal logics [article]

Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch, Stefan Kiefer
<span title="2021-04-20">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We aim at measuring the influence of the nondeterministic choices of a part of a system on its ability to satisfy a specification. For this purpose, we apply the concept of Shapley values to verification as a means to evaluate how important a part of a system is. The importance of a component is measured by giving its control to an adversary, alone or along with other components, and testing whether the system can still fulfill the specification. We study this idea in the framework of
more &raquo; ... king with various classical types of linear-time specification, and propose several ways to transpose it to branching ones. We also provide tight complexity bounds in almost every case.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2102.06655v2">arXiv:2102.06655v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tk5b2mog3rfjhliv4t5ivsjurm">fatcat:tk5b2mog3rfjhliv4t5ivsjurm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210217014147/https://arxiv.org/pdf/2102.06655v1.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/b2/2d/b22d15f4dcacaa8e32bc7ec059ac9dbf79d94cb8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2102.06655v2" 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>

Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints [chapter]

Florian Funke, Simon Jantsch, Christel Baier
<span title="">2020</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This paper introduces Farkas certificates for lower and upper bounds on minimal and maximal reachability probabilities in Markov decision processes (MDP), which we derive using an MDP-variant of Farkas' Lemma. The set of all such certificates is shown to form a polytope whose points correspond to witnessing subsystems of the model and the property. Using this correspondence we can translate the problem of finding minimal witnesses to the problem of finding vertices with a maximal number of
more &raquo; ... . While computing such vertices is computationally hard in general, we derive new heuristics from our formulations that exhibit competitive performance compared to state-of-the-art techniques. As an argument that asymptotically better algorithms cannot be hoped for, we show that the decision version of finding minimal witnesses is NP-complete even for acyclic Markov chains.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-45190-5_18">doi:10.1007/978-3-030-45190-5_18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wvgpvvi2hzhrpbuv6gfl3wodp4">fatcat:wvgpvvi2hzhrpbuv6gfl3wodp4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200510014941/https://link.springer.com/content/pdf/10.1007%2F978-3-030-45190-5_18.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/22/08/2208e0a8ee2b843d6f3aadef744935e1b6092b52.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-45190-5_18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

The Orbit Problem for Parametric Linear Dynamical Systems [article]

Christel Baier, Florian Funke, Simon Jantsch, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell
<span title="2021-04-21">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study a parametric version of the Kannan-Lipton Orbit Problem for linear dynamical systems. We show decidability in the case of one parameter and Skolem-hardness with four or more parameters. More precisely, consider M a d-dimensional square matrix whose entries are rational functions in one or more real variables. Given initial and target vectors u,v ∈ℚ^d, the parametrised point-to-point reachability problem asks whether there exist values of the parameters giving rise to a concrete matrix
more &raquo; ... ∈ℝ^d× d, and a positive integer n, such that N^n u = v. We show decidability in the case where M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem problem for linear recurrence sequences, indicating intractability in the case of four or more parameters.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2104.10634v1">arXiv:2104.10634v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/amwmv4wtnbd5hksbb24ru74t2i">fatcat:amwmv4wtnbd5hksbb24ru74t2i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210423021516/https://arxiv.org/pdf/2104.10634v1.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/52/8e/528e3ea7f1276837a1eb8b5098d4d1c79563e8db.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2104.10634v1" 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>

Drosha protein levels are translationally regulated during Xenopus oocyte maturation

Dominik Muggenhumer, Cornelia Vesely, Simon Nimpf, Nan Tian, Jin Yongfeng, Michael F. Jantsch, Sandra Wolin
<span title="">2014</span> <i title="American Society for Cell Biology (ASCB)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/btmjitlxs5by3dntmzk67gakxi" style="color: black;">Molecular Biology of the Cell</a> </i> &nbsp;
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1091/mbc.e13-07-0386">doi:10.1091/mbc.e13-07-0386</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/24829383">pmid:24829383</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC4072582/">pmcid:PMC4072582</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b5qdw6i5prehdc65jmeeghyfym">fatcat:b5qdw6i5prehdc65jmeeghyfym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190223232220/http://pdfs.semanticscholar.org/4d07/cceb602f83e3426e9d3d29f6bd1b7ff6df5c.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/4d/07/4d07cceb602f83e3426e9d3d29f6bd1b7ff6df5c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1091/mbc.e13-07-0386"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4072582" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </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;
A standard way of justifying that a certain probabilistic property holds in a system is to provide a witnessing subsystem (also called critical subsystem) for the property. 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. This paper considers the problem for probabilistic systems that are similar to trees or paths. It introduces the parameters directed tree-partition width
more &raquo; ... (dtpw) and directed path-partition width (dppw) and shows that computing minimal witnesses remains NP-hard for Markov chains with bounded dppw (and hence also for Markov chains with bounded dtpw). By observing that graphs of bounded dtpw have bounded width with respect to all known tree similarity measures for directed graphs, the hardness result carries over to these other tree similarity measures. Technically, the reduction proceeds via the conceptually simpler matrix-pair chain problem, which is introduced and shown to be NP-complete for nonnegative matrices of fixed dimension. Furthermore, an algorithm which aims to utilise a given directed tree partition of the system to compute a minimal witnessing subsystem is described. It enumerates partial subsystems for the blocks of the partition along the tree order, and keeps only necessary ones. A preliminary experimental analysis shows that it outperforms other approaches on certain benchmarks which have directed tree partitions of small width.
<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>

The Educational Potential of Technologies for Older People - Reflections on the Well-being
english

Anelise Jantsch, Simone C. O. Conceição, José Valdeni de Lima
<span title="">2014</span> <i title="SCITEPRESS - Science and and Technology Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5zxvoqvzubcapei2xrvcvypnee" style="color: black;">Proceedings of the 6th International Conference on Computer Supported Education</a> </i> &nbsp;
ACKNOWLEDGEMENTS Jantsch A. is grateful to CAPES and CNPq for scholarship and financial support, as well she is grateful to seniors who participated in this research.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5220/0004959605390544">doi:10.5220/0004959605390544</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/csedu/JantschCL14.html">dblp:conf/csedu/JantschCL14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pn4v7onwvng67d3kh52jcxn55a">fatcat:pn4v7onwvng67d3kh52jcxn55a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190217230413/http://pdfs.semanticscholar.org/07b4/676968fcae93f00b36dc7bdbacf64c31be7b.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/07/b4/07b4676968fcae93f00b36dc7bdbacf64c31be7b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5220/0004959605390544"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Hypertonicity-enforced BCL-2 addiction unleashes the cytotoxic potential of death receptors

Simon Sirtl, Gertrud Knoll, Dieu Thuy Trinh, Isabell Lang, Daniela Siegmund, Stefanie Gross, Beatrice Schuler-Thurner, Patrick Neubert, Jonathan Jantsch, Harald Wajant, Martin Ehrenschwender
<span title="2018-04-30">2018</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3xwigx3kbzej7bhsigycvwxwiq" style="color: black;">Oncogene</a> </i> &nbsp;
active caspase-8 cleaves the BH3-interacting domain death agonist (BID) to truncated BID (tBID), which in turn stimulates BCL-2-associated X protein (BAX) and BCL-2-These authors contributed equally: Simon  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1038/s41388-018-0265-5">doi:10.1038/s41388-018-0265-5</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/29706657">pmid:29706657</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC6062497/">pmcid:PMC6062497</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lzjyeqtgszahxcajmszbh4so5q">fatcat:lzjyeqtgszahxcajmszbh4so5q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200513051343/http://europepmc.org/backend/ptpmcrender.fcgi?accid=PMC6062497&amp;blobtype=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/22/dc/22dc40a0baff54fc7124ea6c096da9fbb61fcdde.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1038/s41388-018-0265-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6062497" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 637 results