Hochschulschrift
Complexity results for reachability in cooperating systems and approximated reachability by abstract over-approximations
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
30 cm
- Extent
-
X, 233 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Mannheim, Univ., Diss., 2013 (Nicht für den Austausch)
- Keyword
-
PSPACE ; distributed system ; deadlock
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:33 PM CEST
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.
Object type
- Hochschulschrift
Associated
Other Objects (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