Hochschulschrift
Complexity results for reachability in cooperating systems and approximated reachability by abstract over-approximations
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
X, 233 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Mannheim, Univ., Diss., 2013 (Nicht für den Austausch)
- Schlagwort
-
PSPACE ; distributed system ; deadlock
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:33 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
Ähnliche Objekte (12)
Complexity Results for Reachability in Cooperating Systems and Approximated Reachability by Abstract Over-Approximations
Co-operating
Low-Complexity Loeffler DCT Approximations for Image and Video Coding
Complexity results for confluence problems
Aspects of cooperating agents
Cooperating out of poverty?
Aspects of cooperating agents
Complexity results for checking distributed implementability
Abstract state machines : verification problems and complexity
Abstract state machines : verification problems and complexity
Batch Presorting Problems: Models and Complexity Results
Algorithms and complexity results for finite semigroups
Complexity Results for Reachability in Cooperating Systems and Approximated Reachability by Abstract Over-Approximations
Co-operating
Low-Complexity Loeffler DCT Approximations for Image and Video Coding
Complexity results for confluence problems
Aspects of cooperating agents
Cooperating out of poverty?
Aspects of cooperating agents
Complexity results for checking distributed implementability
Abstract state machines : verification problems and complexity
Abstract state machines : verification problems and complexity
Batch Presorting Problems: Models and Complexity Results
Algorithms and complexity results for finite semigroups
Complexity Results for Reachability in Cooperating Systems and Approximated Reachability by Abstract Over-Approximations
Co-operating
Low-Complexity Loeffler DCT Approximations for Image and Video Coding
Complexity results for confluence problems
Aspects of cooperating agents
Cooperating out of poverty?
Aspects of cooperating agents
Complexity results for checking distributed implementability
Abstract state machines : verification problems and complexity
Abstract state machines : verification problems and complexity
Batch Presorting Problems: Models and Complexity Results