This volume contains contributions to the 17th International workshop on Graph-Theoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graph-theoretic methods to discuss new developments relating to or emerging from a diversity of application fields. The topics covered in this volume include: tree-related problems, graph grammarsand rewriting, complexity, computational geometry, parallel algorithms, vertex orderings, path-oriented algorithms, applications to VLSI, and disjoint cycle...

This book constitutes the thoroughly refereed joint postproceedings of the 7th International Seminar on Relational Methods in Computer Science and the 2nd International Workshop on Applications of Kleene Algebra held in Bad Malente, Germany in May 2003.The 21 revised full papers presented were carefully selected during two rounds of reviewing and improvement. The papers address foundational and methodological aspects of the calculi of relations and Kleene algebra as well as applications of such methods in various areas of computer science and information processing.

The correct development of large / com plex pieces of software demands a thorough structuring of the design process. In a first phase the requirements engineering is relevant for capturing the relevant functionality and its adequate formalization in precise mathematical definitions. Prototyping can can be used as a means for checking the functional behaviour at this early stage of development. The ade quate specification resulting from the first phase is then the basis for the second phase which comprises the derivation of an implementation. This phase requires the use of formal methods and...

Das Lehrbuch fuhrt in wichtige Themen der Ordnungs- und Verbandstheorie ein und behandelt bedeutende Informatikanwendungen. Die Ordnungs- und Verbandstheorie wird zur algebraischen Theorie der Relationen, kurz Relationenalgebra, ausgebaut. Des Weiteren widmet sich das Buch Informatikanwendungen, hauptsachlich der formalen Entwicklung von Algorithmen fur diskrete Probleme. Beispiele aus der Ordnungs- und Verbandstheorie schlagen den Bogen zuruck zum ersten Teil des Buches."

Das Lehrbuch stellt eine grundlegende Einfuhrung in die mathematische Theorie der geordneten Mengen und Verbande dar. Neben wichtigen Begriffen werden allgemeine Vorgehensweisen und Beweistechniken demonstriert, die fur dieses Gebiet typisch sind. Auch werden eine Reihe von Anwendungen diskutiert, insbesondere aus der Informatik, wie logische Schaltungen, Semantik von Programmiersprachen und die Untersuchung von Kausalitat in verteilten Systemen.

"