Uni Logo

FORSCHUNGSBERICHT 1999-2001

INDEX
Prev.:Institut für Angewandte Mathematik Abt.f.Wiss.Rechnen u. Num.Simulation
Next:Institut für Informatik Abteilung für Informatik II
Up:Forschungsbericht
Up:Mathematisch-Naturwissenschaftliche Fakultät

Institut für Informatik Abteilung für Informatik I

Allgemeine Angaben:
Sekretariat: Frau Mariele Knepper, Römerstr. 164, D-53117 Bonn
Telefon: (0228) / 7343-33
Fax: (0228) / 7343-21
eMail: knepper@cs.uni-bonn.de
WWW: http://web.cs.uni-bonn.de/I

Hauptamtliche Professoren:
Prof. Dr. Christel Baier
Prof. Dr. Rolf Klein (Die Arbeitsgruppe von Rolf Klein ist seit Juli 2000 in Bonn)

Wissenschaftliches Personal:
Universitätsstellen
Dr. Alexander Asteroth
Dipl. Inform. Frank Ciesinski
Dipl.-Phys. Annette Ebbers-Baumann
Dipl.-Inform. Thomas Kamphans
Dr. Elmar Langetepe
Dr. Eduard Peters

Drittmittelstellen
Dipl.-Inform. Britta Landgraf (DFG)
Dr. Lihong Ma (DFG)

Stipendiaten
Dr. Alexander Asteroth (Wernher von Braun-Stiftung zur Förderung der Weltraumwissenschaften)

Forschungsschwerpunkte:
Medizin-Informatik, Simulation medizinischer Prozesse
(Dr. A. Asteroth)

Formale Methoden
(Prof. Dr. C. Baier)

Bibliographische Datenbanken und Visualisierung von inhaltsbasierten Beziehungen (BibRelEx)
(Prof. Dr. R. Klein, Dipl.-Inform. B. Landgraf)

Animation Geometrischer Algorithmen
(Prof. Dr. R. Klein , Dipl.-Inform. Th. Kamphans, Dr. E. Langetepe)

Algorithmische Bewegungsplanung für mobile Roboter
(Prof. Dr. R. Klein, Dipl.-Inform. Th. Kamphans, Dr. E. Langetepe)

Algorithmische Geometrie
(Prof. Dr. R. Klein, Dipl.-Phys. A. Ebbers-Baumann, Dr. E. Langetepe, Dr. L. Ma)

Besondere Forschungsförderung:
Computerunterstuetzte Verifikation mit abstrakten Modellen (DFG-1679/3-1)
(DFG)

DFG-Schwerpunkt: Effiziente Algorithmen und Ihre Anwendung, Projekt: Entwurf, Design und Analyse kompetitiver Strategien zur Bahnplanung autonomer Systeme
(Prof. Dr. R. Klein, Dipl.-Inform. Th. Kamphans, Dr. E. Langetepe, DFG Grant Kl 655/8-3)

Effiziente Algorithmen zur Simulation von Kreislaufveränderungen bei Astronauten
(Dr. A. Asteroth, Wernher von Braun-Stiftung zur Förderung der Weltraumwissenschaften)

Förderung des projektbezogenen Wissenschaftleraustauschs (Stochastische Modellierung und Verifikation) (ARC-DAAD)
(Prof. Dr. C. Baier, Dr. A. Asteroth, DAAD)

Lokalisationsplanung durch Voronoi Diagramme
(Prof. Dr. R. Klein, Dr. E. Langetepe, Dr. L. Ma, DAAD Grant 314-AI-e-dr)

Spezifikations-Formalismen und der Entwurf von Verifikationsmethoden für probabilistische reaktive Systeme (DFG-MA-794/3-1 und 3-2)
(DFG)

Validation of Stochastic Systems( DFG-NWO Projekt BA 1679/2)
(Dr. A. Asteroth, Prof. Dr. C. Baier, Dipl. Inform. F. Ciesinski, M. Sc. M. Größer, DFG, NWO)

Veröffentlichungen:

Abdulla P., Baier C., Iyer P., Jonsson B.
Reasoning about Probabilistic Channel Systems
Proc. CONCUR 2000, Lecture Notes in Computer Science, Vol. 1877, pp 320-330

Abellanas, M., Hurtado, F., Icking, Ch., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristan, V.
Proximity problems for time metrics induced by the L1 metric and isothetic networks
IX Encuentros en Geometri a Computacional, N. Noll et al. (eds.), Girona, Universitat de Girona, pp 175-181

Abellanas, M., Hurtado, F., Icking, Ch., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristan, V.
Smallest Color-Spanning Objects
Proc. 9th Annu. European Sympos. Algorithms, ESA 2001, Lecture Notes Comput. Sci. 2161, Springer-Verlag, pp 278-289

Abellanas, M., Hurtado, F., Icking, Ch., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristan, V.
The Farthest Color Voronoi Diagram and Related Problems
Abstracts 17th European Workshop Comput. Geom., CG 2001 Berlin, pp 113-116

Agarwal, P.-K., Klein, R., Knauer, Ch., Sharir, M.
Computing the detour of polygonal curves
Technical Report B02-03, Free University of Berlin, Department of Mathematics and Computer Science

Aichholzer, 0., Aurenhammer, F., Icking, Ch., Klein, R., Langetepe, E., Günter, R.
Generalized Self-Approaching Curves
Discrete Appl. Math., Vol. 109, pp 3-24

Asteroth, A.
Effiziente Identifikation parametrisierter Kreislaufmodelle
Dissertation, Universität Bonn

Asteroth, A., Frings, J., Möller, K.
Parameter Identification Using Aspects - Application to the Human Cardiovascular System
Proceedings of the 10th Italian Workshop on Neural Nets, WIRN Vietri

Asteroth, A., Kunze, T., Frings, J., Möller, K., Drescher, J.
Model Based Classification of Cardiovascular Response Patterns
Journal of Gravitational Physiology

Asteroth, A., Möller. K.
Identification of Individualized Models of the Human Cardiovascular System
Proceedings of the Workshop on Machine Learning in Medical Applications, ACAI'99

Asteroth A., Baier, C., Aßmann, U.
Model Checking with formula-dependent abstract models
Proc. CAV'01, Lecture Notes in Computer Science, Vol. 2102, pp 155-168

Aurenhammer, F., Klein, R.
Voronoi Diagrams
In Handbook of Computational Geometry, edited by Jörg-Rüdiger Sack, Jorge Urrutia, Elsevier Science Publishers B.V. North-Holland, Amsterdam, pp. 201-290

Baier, C., Clarke, E., Hartonas-Garmhausen, V.
On the Semantic Foundations of Probabilistic VERUS
Proc. Workshop on Probabilistic Methods in Verification (PROBMIV'98), Electronic Notes in Theoretical Computer Science, Vol. 21

Baier, C., Engelen, B., Majster-Cederbaum, M.
Deciding Bisimilarity and Similarity for Probabilistic Processes
Journal of Computer and System Sciences 60, pp 187-231

Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.
On logical characterisations of performability properties
Proc. ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, pp 780-792

Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.
Model Cheching continuous-time Markov chains by transient analysis
Proc. CAV 2000, Lecture Notes in Computer Science, Vol. 1855, pp 358-372

Baier, C., Katoen, J.-P., Hermanns, H.
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
Proc. 10th International Conference on Concurrency Theory (CONCUR'99), Lecture Notes in Computer Science, Vol. 1664, pp 146-161

Baier, C., Kwiatkowska, M. Z.
Domain Equations for Probabilistic Processes
Mathematical Structures in Computer Science, Vol. 10 (6), pp 665-717

Baier, C., Kwiatkowska, M. Z.
On Topological Hierarchies of Temporal Properties
Fundamentae Informaticae, Vol. 41, pp 259-294

Baier, C., Kwiatkowska, M. Z., Norman, G.
Computing Probability Bounds for Linear Time Formulas over Concurrent Markov Chains
Proc. Workshop on Probabilistic Methods in Verification (PROBMIV'98), Electronic Notes in Theoretical Computer Science, Vol. 21

Baier, C., Stoelinga, M.
Norm functions for probabilistic bisimulations with delays
Proc. FOSSACS 2000, pp 1-16, Lecture Notes in Computer Science, Vol. 1784

Brüggemann-Klein, A., Klein, R., Landgraf B.
BibRelEx: Exploring Bibliographic Databases by Visualization of A
Proc. Information Visualisation in Digital Libraries

Ebbers-Baumann, A., Klein, R., Langetepe, E., Lingas, A.
A Fast Algorithm for Computing the Detour of a Polygonal Chain
Proc. 13th Annu. International Sympos. Algorithms and Computation, ISAAC 2002, Lecture Notes Comput. Sci., Proc. 9th Annu. European Sympos. Algorithms, ESA 2001, Lecture Notes Comput. Sci. 2161, Springer-Verlag, pp 321-332

Hoffmann, F., Icking, Ch., Klein, R., Kriegel, K.
The Polygon Exploration Problem
SIAM J. Comput., Vol 31

Icking, Ch., Kamphans, T., Klein, R., Langetepe, E.
Exploring an Unknown Cellular Environment
Abstracts 16th European Workshop Comput. Geom., CG 2000, Eilat, Ben-Gurion University of the Negev, pp 140-143

Icking, Ch., Klein, R., Kamphans, T., Langetepe, E.
On the Competitive Complexity of Navigation Tasks
Sensor Based Intelligent Robots, Dagstuhl Seminar Report, pp 255-269

Icking, Ch., Klein, R., Ma, L., Nickel, St., Weißler A.
On Bisectors for Different Distance Functions
Discrete Appl. Math., Vol. 109, pp. 139-161

Icking, Ch., Ma, L.
A Tight Bound for the Complexity of Voronoi Diagrams under Polyhedral Convex Distance Functions in 3D
Proc. 33rd Annu. ACM Sympos. Theory Comput., Crete, Greece, pp. 316-321.

Katoen, J.-P., Baier, C., Latella, D.
Metric Semantics for True Concurrent Real-Time
Theoretical Computer Science, Vol. 254 (No. 1-2), pp 501-542


eMail: Transfer und Öffentlichkeitsarbeit