- Alternative title
-
Komplexität der Verifikation parametrisierter Systeme
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
München, Technische Universität München, Dissertation, 2024
- Keyword
-
Verifikation
Berechnungskomplexität
Model Checking
Parametrisierte Komplexität
Temporale Logik
- Event
-
Veröffentlichung
- (where)
-
München
- (who)
-
Universitätsbibliothek der TU München
- (when)
-
2024
- Creator
-
Ayikudi Ramachandrakumar, Balasubramanian
- Contributor
-
Esparza Estaun, Francisco Javier
Esparza Estaun, Francisco Javier
Abdulla, Parosh Aziz
Bouajjani, Ahmed
- URN
-
urn:nbn:de:bvb:91-diss-20240417-1714488-1-4
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:55 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Ayikudi Ramachandrakumar, Balasubramanian
- Esparza Estaun, Francisco Javier
- Abdulla, Parosh Aziz
- Bouajjani, Ahmed
- Universitätsbibliothek der TU München
Time of origin
- 2024
Other Objects (12)
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Verifying probabilistic systems : new algorithms and complexity results
Parameterized complexity of weighted team definability
Parameterized complexity of configuration integer programs
A note on the computational complexity of some problems for self-verifying finite automata
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Model-checking problems, machines and parameterized complexity
Complexity and approximability of parameterized MAX-CSPs
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Verifying probabilistic systems : new algorithms and complexity results
Parameterized complexity of weighted team definability
Parameterized complexity of configuration integer programs
A note on the computational complexity of some problems for self-verifying finite automata
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Model-checking problems, machines and parameterized complexity
Complexity and approximability of parameterized MAX-CSPs
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Verifying probabilistic systems : new algorithms and complexity results
Parameterized complexity of weighted team definability
Parameterized complexity of configuration integer programs
A note on the computational complexity of some problems for self-verifying finite automata
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Model-checking problems, machines and parameterized complexity
Complexity and approximability of parameterized MAX-CSPs
Parameterized Complexity of Min-Power Asymmetric Connectivity