Filters








4 Hits in 1.1 sec

SWITSS: Computing Small Witnessing Subsystems [article]

Simon Jantsch, Hans Harder, Florian Funke, Christel Baier
2020 arXiv   pre-print
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.  ... 
arXiv:2008.04049v1 fatcat:6bwert5vwng7dha5nlb7bog3jm

SWITSS: Computing Small Witnessing Subsystems [article]

Simon Jantsch, Hans Harder, Florian Funke, Christel Baier, Alexander Ivrii, Ofer Strichman
2020
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.  ... 
doi:10.34727/2020/isbn.978-3-85448-042-6_31 fatcat:67lrmtpbkrfq5chnocunvtvi54

Witnessing Subsystems for Probabilistic Systems with Low Tree Width

Simon Jantsch, Jakob Piribauer, Christel Baier
2021 Electronic Proceedings in Theoretical Computer Science  
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.  ... 
doi:10.4204/eptcs.346.3 fatcat:ubd6scfhdjbxhpdiypms3evqii

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

Simon Jantsch, Jakob Piribauer, Christel Baier
2021 arXiv   pre-print
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.  ... 
arXiv:2108.08070v1 fatcat:3uwe4jxcfve73lwzn3mw4sttca