Hochschulschrift
Verifying probabilistic systems : new algorithms and complexity results
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
0935-3232
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Aachen, Techn. Hochsch., Diss., 2014
- Erschienen in
-
Aachener Informatik-Berichte ; 16/2014
- Klassifikation
-
Mathematik
- Schlagwort
-
Verifikation , Algorithmus
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen
- (wann)
-
2014
- Urheber
- URN
-
urn:nbn:de:hbz:82-opus-52856
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.06.20252025, 13:39 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Fu, Hongfei
- Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen
Entstanden
- 2014
Ähnliche Objekte (12)
Computational Complexity of Verifying Parameterized Systems
The complexity of verifying population protocols
Algorithms and complexity results for finite semigroups
Complexity results and practical algorithms for logics in knowledge representation
Complexity results and practical algorithms for logics in knowledge representation
Scheduling jobs with communication delays : complexity results and approximation algorithms
Probabilistic analysis of simplex algorithms
Decision algorithms for probabilistic simulations
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions
Verifying OPAL, Pt. 1.. Verifying in the small
Computational Complexity of Verifying Parameterized Systems
The complexity of verifying population protocols
Algorithms and complexity results for finite semigroups
Complexity results and practical algorithms for logics in knowledge representation
Complexity results and practical algorithms for logics in knowledge representation
Scheduling jobs with communication delays : complexity results and approximation algorithms
Probabilistic analysis of simplex algorithms
Decision algorithms for probabilistic simulations
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions
Verifying OPAL, Pt. 1.. Verifying in the small
Computational Complexity of Verifying Parameterized Systems
The complexity of verifying population protocols
Algorithms and complexity results for finite semigroups
Complexity results and practical algorithms for logics in knowledge representation
Complexity results and practical algorithms for logics in knowledge representation
Scheduling jobs with communication delays : complexity results and approximation algorithms
Probabilistic analysis of simplex algorithms
Decision algorithms for probabilistic simulations
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions