@inproceedings{39434,
  abstract     = {{In diesem Artikel stellen wir die Anwendung von Modellprüfung für ein
Fertigungssystem mit freifahrenden Transportfahrzeugen vor. Dabei konzentrieren wir
uns darauf, den Materialfluss in einem Systemmodell auf die Einhaltung quantitativer
und zeitlicher Bedingungen hin zu überprüfen. Zur Modellentwicklung setzen wir die
graphische Beschreibungsmethode MFERT ein, die sich bereits mehrfach in
Industrieprojekten bewährt hat. Wir präsentieren eine Abbildung von MFERT in
zeitannotierte Zustandsübergangssysteme, die für ein bereits existierendes Werkzeug zur
Modellprüfung als Eingabe einer Modellbeschreibung dienen. Bei der Modellprüfung
wird diese Beschreibung auf die Einhaltung von Eigenschaften überprüft, die in einer
temporalen Logik oder einer davon abstrahierten Form spezifiziert werden.}},
  author       = {{Flake, Stephan and Müller, Wolfgang and Pape, Ulrich and Ruf, Jürgen}},
  title        = {{{Modellprüfung für den Entwurf von Fertigungssteuerungssystemen}}},
  year         = {{2000}},
}

@inproceedings{39444,
  abstract     = {{Prototyping mit 3D-Modellen in virtueller Umgebung ist eine kostengünstige Alternative zur Entwicklung von physikalischen Modellen und Mock-ups. Für einige Anwendungen ergeben sich erhebliche Vorteile durch die Validierung in einer virtuellen Umgebung. In diesem Artikel stellen wir den Einsatz einer 3D-Animation zur Entwicklung und zum Test einer Fahrzeugsteuerung vor. Basierend auf dem Prinzip der schrittweisen Verfeinerung kann die Steuerung zunächst nur unter Berücksichtigung der Kommunikation zwischen den Basiskomponenten entworfen werden. Im zweiten Schritt wird die Ansteuerung der Aktoren unter Auswertung der Sensoren berücksichtigt. Letztendlich ist das System unter Einflussnahme der physikalischen Größen zu validieren. Wir stellen die Schnittstelle exemplarisch anhand einer Steuerung für fahrerlose Transportfahrzeuge im Szenario eines holonischen Transportsystems vor. }},
  author       = {{Braatz, A. and Flake, Stephan and Müller, Wolfgang and Westkämper, E.}},
  title        = {{{Prototyping einer Fahrzeug-steuerung in einer virtuellen 3D-Umgebung}}},
  year         = {{2000}},
}

@inproceedings{39461,
  abstract     = {{Model checking has received wide acceptance as a valuable technique in the field of electronic
design automation and is currently of growing interest in general systems design. Though its
concepts and applications are well understood it often turns out that engineers have severe
problems with the specification process and the underlying notation, i.e., formulation and
understanding of specifications through means of temporal logic formulae. In this article, we
present an approach for a natural language–oriented representation of temporal logic formulae
by introducing patterns of structured English sentences for Clocked CTL (CCTL) specification.
After outlining the basic patterns of the sentences we give their semantics by a translation to
CCTL. A final example demonstrates their application.}},
  author       = {{Flake, Stephan and Müller, Wolfgang and Ruf, Jürgen}},
  title        = {{{Structured English for Model Checking Specification}}},
  year         = {{2000}},
}

@inproceedings{39435,
  abstract     = {{This article presents SAL (Synchronous Agent Language), a general-purpose grid{based 2D programming language for parallel system specication, implementation, and visualization. SAL agents have a depiction and a behavior. The behavior is dened by the means of state transition rules. The depiction is given by the drawing area on its surface. Actions in rules can execute drawing operations for dynamically changing the depiction during runtime. For a broader range of applications, SAL incorporates mobile code, code modication during runtime, and tool integration facilities.}},
  author       = {{Müller, Wolfgang and Meyer, Arne and Zabel, Henning}},
  booktitle    = {{Proceedings of the IEEE Symposium on Visual Languages}},
  title        = {{{A Visual Framework for the Scripting of Parallel Agents}}},
  year         = {{2000}},
}

@inproceedings{39439,
  author       = {{Bhatt, P. C. P. and Müller, Wolfgang}},
  booktitle    = {{Proceedings of IECON 2000}},
  title        = {{{A Methodology for the Protocol-Centered Design of Agent-Based Systems}}},
  year         = {{2000}},
}

@inproceedings{39442,
  author       = {{Bhatt, P. C. P. and Müller, Wolfgang}},
  booktitle    = {{Proceedings of UKPEW 2000}},
  title        = {{{Morphic Nets: Model Based Design Diagrams}}},
  year         = {{2000}},
}

@inproceedings{39464,
  author       = {{Flake, Stephan and Müller, Wolfgang and Ruf, Jürgen}},
  booktitle    = {{Proceedings of AVI 2000}},
  title        = {{{An Advanced Visual Capture for Model Checking Specifications}}},
  year         = {{2000}},
}

@inproceedings{19732,
  abstract     = {{The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In ad-dition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in its implementation deviate significantly from the techniques used in other BSP libraries.}},
  author       = {{Bonorden, Olaf and Juurlink, Bernhardus and Von Otte, I. and Rieping, Ingo}},
  booktitle    = {{Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing}},
  isbn         = {{0769501435}},
  pages        = {{99--104}},
  title        = {{{The Paderborn university BSP (PUB) library-design, implementation and performance}}},
  doi          = {{10.1109/ipps.1999.760442}},
  year         = {{1999}},
}

@article{19815,
  author       = {{Kleine Büning, Hans and Lettmann, Theodor}},
  issn         = {{0166-218X}},
  journal      = {{Discrete Applied Mathematics}},
  pages        = {{139--148}},
  title        = {{{Resolution remains hard under equivalence}}},
  doi          = {{10.1016/s0166-218x(99)00055-4}},
  year         = {{1999}},
}

@article{3252,
  author       = {{Wehrheim, Heike}},
  journal      = {{Electr. Notes Theor. Comput. Sci.}},
  pages        = {{71----84}},
  title        = {{{Partial order reductions for failures refinement}}},
  doi          = {{10.1016/S1571-0661(05)80296-8}},
  year         = {{1999}},
}

@inproceedings{3253,
  author       = {{Wehrheim, Heike}},
  booktitle    = {{FM'99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}}},
  editor       = {{M. Wing, Jeannette and Woodcock, Jim and Davies, Jim}},
  pages        = {{1028----1047}},
  title        = {{{Data Abstraction for {CSP-OZ}}}},
  doi          = {{10.1007/3-540-48118-4_5}},
  year         = {{1999}},
}

@inproceedings{3254,
  author       = {{Fischer, Clemens and Wehrheim, Heike}},
  booktitle    = {{Integrated Formal Methods, Proceedings of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999}},
  editor       = {{Araki, Keijiro and Galloway, Andy and Taguchi, Kenji}},
  pages        = {{315----334}},
  title        = {{{Model-Checking {CSP-OZ} Specifications with {FDR}}}},
  year         = {{1999}},
}

@article{2151,
  author       = {{Flammini, Michele and Scheideler, Christian}},
  journal      = {{Theory Comput. Syst.}},
  number       = {{3}},
  pages        = {{387----420}},
  title        = {{{Simple, Efficient Routing Schemes for All-Optical Networks}}},
  doi          = {{10.1007/s002240000123}},
  volume       = {{32}},
  year         = {{1999}},
}

@inproceedings{2164,
  author       = {{Berenbrink, Petra and Scheideler, Christian}},
  booktitle    = {{SODA}},
  pages        = {{112----121}},
  title        = {{{Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths}}},
  year         = {{1999}},
}

@inproceedings{2165,
  author       = {{Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}},
  booktitle    = {{SPAA}},
  pages        = {{33----42}},
  title        = {{{Simple Competitive Request Scheduling Strategies}}},
  year         = {{1999}},
}

@inproceedings{17864,
  abstract     = {{A geometric spanner with vertex set P in Rd is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k in N and the stretch factor f>1 describing the “quality” of approximation. PNGs have been throughly investigated with respect to small values of f. We present in this work results about small values of k. The aim of minimizing k rather than f arises from two observations:

* k determines the amount of space required for storing PNGs.

* Many algorithms employing a (previously constructed) spanner have running times depending on its outdegree.

Our results include, for fixed dimensions d as well as asymptotically, upper and lower bounds on this optimal value of k. The upper bounds are shown constructively and yield efficient algorithms for actually computing the corresponding PNGs even in degenerate cases.
}},
  author       = {{Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin}},
  booktitle    = {{Proceedings of the 11th Canadian Conference on Computational Geometry}},
  title        = {{{Partitioned neighborhood spanners of minimal outdegree}}},
  year         = {{1999}},
}

@inproceedings{18747,
  abstract     = {{We present a new ( O(n) ) algorithm to compute good orders for the point set of a Delaunay triangulation of ( n ) points in the plane. Such a good order makes reconstruction in ( O(n) ) time with a simple algorithm possible. In contrast to the algorithm of Snoeyink and van Kreveld cite1, which is based on independent sets, our algorithm uses a breadth first search (BFS) to obtain these orders. Both approaches construct such orders by repeatedly removing a constant fraction of vertices from the current triangulation. The advantage of the BFS approach is that we can give significantly better bounds on the fraction of removed points in a phase of the algorithm. We can prove that a single phase of our algorithm removes at least ( frac13 ) of the points, even if we restrict the degree of the points (at the time they are removed) to 6. We implemented and compared both algorithms. Our algorithms is slightly faster and achieves about 15% better vertex data compression when using a simple variable length code to encode the differences between two consecutive vertices of the given order.}},
  author       = {{Sohler, Christian}},
  booktitle    = {{Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG'99)}},
  pages        = {{136--141}},
  title        = {{{Fast Reconstruction of Delaunay Triangulations}}},
  year         = {{1999}},
}

@phdthesis{18942,
  author       = {{Lukovszki, Tamás}},
  isbn         = {{3-931466-62-0 }},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{New Results on Geometric Spanners and Their Applications}}},
  volume       = {{63}},
  year         = {{1999}},
}

@inproceedings{18959,
  abstract     = {{We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S be a set of $n$ points in the d-dimensional space and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path.<br><br>Recently it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner with O(k^2 n) edges which can be constructed in O(n log n + k^2 n) time. Furthermore, it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner whose degree is bouned by O(c^k+1) for some constant c.<br><br>Our first contribution is a construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound. The computation takes O(n log^d-1 n + k n log log n) time. Then we show that the same k-vertex fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct a k-vertex fault tolerant spanner with O(k^2 n) edges whose degree is bounded by O(k^2). Finally, we give a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S. We investigate the question whether Steiner points help. We answer this question affirmatively and prove Theta(kn) bounds on the number of Steiner points and on the number of edges in such spanners.}},
  author       = {{Lukovszki, Tamás}},
  booktitle    = {{Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS}},
  isbn         = {{9783540662792}},
  issn         = {{0302-9743}},
  pages        = {{193--204}},
  title        = {{{New Results on Fault Tolerant Geometric Spanners}}},
  doi          = {{10.1007/3-540-48447-7_20}},
  year         = {{1999}},
}

@inproceedings{18965,
  author       = {{Krick, Christof and Meyer auf der Heide, Friedhelm and Räcke, Harald and Vöcking, Berthold and Westermann, Matthias}},
  booktitle    = {{Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '99}},
  isbn         = {{1581131240}},
  pages        = {{165--174}},
  title        = {{{Data management in networks: experimental evaluation of a provably good strategy}}},
  doi          = {{10.1145/305619.305637}},
  year         = {{1999}},
}