Bearbeite Inproceedings: Inproceedings1564925008

Du bist aus dem folgenden Grund nicht berechtigt, diese Seite bearbeiten:

Diese Aktion ist auf Benutzer beschränkt, die der Gruppe „Benutzer“ angehören.

Authors

First author:

Further authors:

list of full author names as shown on paper, separated by semicolon

Inproceedings

Referiert:	Hilfe
Titel:	Hilfe
To appear:	Hilfe
Jahr:	Hilfe
Monat:	Hilfe
Titel des Gesamtwerks:	Hilfe
Seiten:	Hilfe
Verlag:	If the publisher is Springer "Verlag Berlin...", please type only Springer to display the acknowledgement properly. Hilfe
Editors (Herausgeber):	List of full names, separated by commas
Reihe:	Hilfe
Volume:	Hilfe
Bemerkung:	This remark will appear on the page below the abstract (but not in the bibtex "note" field)

weitere Tools

Weitere hinzufügen

weitere Datasets

Weitere hinzufügen

Details

Bild:	Datei hochladen You can provide a picture here, such as the front page of the journal, to be displayed with your publication. If you provide a pdf file in "Download" below, and no picture here, the first page of the pdf file will be displayed with your publication. In other cases, an icon will be displayed. Hilfe
Abstract:	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 (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. Hilfe
ISBN:	Hilfe
ISSN:	Hilfe
Download:	Datei hochladen Upload a single file. No comma is allowed after the file extension. If the publisher is springer, type "Springer" in the publisher field above. It will automatically generate the acknowledgement according to the licence. Hilfe
Slides:	Datei hochladen Upload a single file. No comma is allowed after the file extension. Hilfe
Link:	Here you can provide links to additional files. Use comma and space (", ") to separate the links. Hilfe
DOI Name:	If the publisher is springer, type "Springer" in the publisher field above. It will automatically generate the acknowledgement according to the licence. If the DOI name is also provided, the acknowledgement will contain the DOI link. Hilfe
Projekt:	To deselect, use Control. Hilfe
Forschungsgruppe:	To deselect, use Control. Hilfe
BibTex:	Leave blank if you want the system to generate a bibtex entry. You can also enter your own bibtex entry here. In that case, do not enter {{ nor }}, but put a space in between, that is, type { { or } }, respectively. It will be displayed properly. Hilfe

Forschungsgebiet

Weitere hinzufügen

Freitext:

Zusammenfassung:

Nur Kleinigkeiten wurden verändert

Diese Seite beobachten

Abbrechen