@phdthesis{Cheng2010,
  author    = {Cheng, Feng},
  title     = {Physical separation technology and its lock-keeper implementation},
  address   = {Potsdam},
  pages     = {114 S.},
  year      = {2010},
  language  = {en}
}
@phdthesis{Bleiholder2010,
  author    = {Bleiholder, Jens},
  title     = {Data fusion and conflict resolution in integrated information systems},
  address   = {Potsdam},
  pages     = {171 S.},
  year      = {2010},
  language  = {en}
}
@phdthesis{Uflacker2010,
  author    = {Uflacker, Matthias},
  title     = {Monitoring virtual team collaboration : methods, applications and experiences in engineering design},
  address   = {Potsdam},
  pages     = {203 S.},
  year      = {2010},
  language  = {en}
}
@phdthesis{Bohnet2010,
  author    = {Bohnet, Johannes},
  title     = {Visualization of Execution Traces and its Application to Software Maintenance},
  address   = {Potsdam},
  pages     = {150 S.},
  year      = {2010},
  language  = {en}
}
@article{HermenegildoSchaub2010,
  author    = {Hermenegildo, Manuel and Schaub, Torsten H.},
  title     = {Introduction to the technical communications of the 26th International Conference on Logic Programming : special issue},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068410000153},
  year      = {2010},
  language  = {en}
}
@article{CsuhajVarjuDassowVaszil2010,
  author    = {Csuhaj-Varj{\´u}, Erzs{\´e}bet and Dassow, Juergen and Vaszil, Gy{\"o}rgy},
  title     = {Variants of competence-based derivations in CD grammar systems},
  issn      = {0129-0541},
  doi       = {10.1142/S0129054110007428},
  year      = {2010},
  abstract  = {In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.},
  language  = {en}
}
@article{BordihnDassowHolzer2010,
  author    = {Bordihn, Henning and Dassow, Juergen and Holzer, Markus},
  title     = {Extending regular expressions with homomorphic replacement},
  issn      = {0988-3754},
  doi       = {10.1051/Ita/2010013},
  year      = {2010},
  abstract  = {We define H- and EH-expressions as extensions of regular expressions by adding homomorphic and iterated homomorphic replacement as new operations, resp. The definition is analogous to the extension given by Gruska in order to characterize context-free languages. We compare the families of languages obtained by these extensions with the families of regular, linear context-free, context-free, and EDT0L languages. Moreover, relations to language families based on patterns, multi-patterns, pattern expressions, H-systems and uniform substitutions are also investigated. Furthermore, we present their closure properties with respect to TRIO operations and discuss the decidability status and complexity of fixed and general membership, emptiness, and the equivalence problem.},
  language  = {en}
}
@article{BlumBoldeaMagedanzetal.2010,
  author    = {Blum, Niklas and Boldea, Irina and Magedanz, Thomas and Margaria, Tiziana},
  title     = {Service-oriented access to next generation networks : from service creation to execution},
  issn      = {1383-469X},
  doi       = {10.1007/s11036-010-0222-1},
  year      = {2010},
  abstract  = {Existing telecommunication networks and classical roles of operators are subject to fundamental change. Many network operators are currently seeking for new sources to generate revenue by exposing network capabilities to 3rd party service providers. At the same time we can observe that services on the World Wide Web (WWW) are becoming mature in terms of the definition of APIs that are offered towards other services. The combinations of those services are commonly referred to as Web 2.0 mash-ups. Rapid service design and creation becomes therefore important to meet the requirements in a changing technology and competitive market environment. This report describes our approach to include Next Generation Networks (NGN)-based telecommunications application enabler into complex services by defining a service broker that mediates between 3rd party applications and NGN service enablers. It provides policy-driven orchestration mechanisms for service enablers, a service authorization functionality, and a service discovery interface for Service Creation Environments. The work has been implemented as part of the Open SOA Telco Playground testbed at Fraunhofer FOKUS.},
  language  = {en}
}
@phdthesis{Wolter2010,
  author    = {Wolter, Christian},
  title     = {A methodology for model-driven process security},
  address   = {Potsdam},
  pages     = {xv, 144 S. : graph. Darst.},
  year      = {2010},
  language  = {en}
}
@phdthesis{Noll2010,
  author    = {Noll, Michael G.},
  title     = {Understanding and leveraging the social web for information retrieval},
  address   = {Potsdam},
  pages     = {xi, 223 S. : Ill., graph. Darst.},
  year      = {2010},
  language  = {en}
}