Lehrstuhl für Informatik I

Prof. Dr. Walter Vogler

Anschrift: (mail address)

Institut für Informatik
Universität Augsburg
D-86135 Augsburg

Hausanschrift: (physical address, for visitors and parcel delivery)

Universitätsstr. 14
D-86159 Augsburg

Telefon: (0821) 598 - 2120
Telefax: (0821) 598 - 2175

E-Mail: Walter.Vogler Informatik.Uni-Augsburg.DE

Vorlesungsnotizen

Diplomarbeitsthemen

Einige neuere Arbeiten / some recent papers:

• The Limit of Split-n-Language Equivalence (~225k)
  (Abstract)
  Information and Computation 127 (1996) 41-61.
  An extended abstract has appeared in Proc. ICALP 95, LNCS 944
• Fairness and Partial Order Semantics (~62k)
  (Abstract)
  Information Processing Letters 55 (1995) 33-39
• Faster Asynchronous Systems (~158k)
  (Abstract)
  Universität Augsburg, Institut für Mathematik, Report 317, 1995
  An extended abstract has appeared in Proc. CONCUR 95, LNCS 962
  Final version in Information and Computation 184 (2003) 311-342
• Fast Asynchronous Systems in Dense Time (with L. Jenner) (~184k)
  (Abstract)
  Universität Augsburg, Institut für Mathematik, Report 344, 1995
  An extended abstract has appeared in Proc. ICALP 96, LNCS 1099
  Final version in Theor. Comput. Sci. 254 (2001) 379 - 422
• Efficiency of Asynchronous Systems, Read Arcs, and the MUTEX-Problem
  (~173k)
  (Abstract)
  Revised version of:
  Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
  Universität Augsburg, Institut für Mathematik, Report 352, 1996
  An extended abstract has appeared in Proc. ICALP 97, LNCS 1256
  Final version in Theor. Comput. Sci. 275 (2002) 589 - 631
• Partial Order Semantics and Read Arcs (~115k)
  (Abstract)
  Universität Augsburg, Institut für Informatik, Report 1997-1
  An extended abstract has appeared in Proc. MFCS 97, LNCS 1295
  Final version in Theor. Comput. Sci. 286 (2002) 33-63
• Efficiency of Token-Passing MUTEX-Solutions - Some Experiments (with E. Bihler)
  extended abstract in Proc. Applications and Theory of Petri Nets 1998, LNCS 1420
• Unfolding and Finite Prefix for Nets with Read Arcs (with A. Semenov, A. Yakovlev)
  Technical Report No.634, Computing Science, Univ. Newcastle upon Tyne, 1998
  extended abstract in Proc. CONCUR 98, LNCS 1466
• Comparing the Efficiency of Asynchronous Systems (with L. Jenner)
  Universität Augsburg, Institut für Informatik, Report 1998-3, 1998
  extended abstract in Proc. ARTS 99, LNCS 1295
• Concurrent Implementation of Asynchronous Transition Systems
  (Abstract)
  Universität Augsburg, Institut für Informatik, Report 1998-5, 1998
  extended abstract in Proc. Applications and Theory of Petri Nets 1999, LNCS 1639
• Efficiency of Asynchronous Systems That Communicate Asynchronously
  (Abstract)
  Universität Augsburg, Institut für Informatik, Report 1999-6, 1996
  extended abstract in Proc. Applications and Theory of Petri Nets 2000, LNCS 1825, 424 - 444
• Axiomatizing a Fragment of PAFAS (with L. Jenner)
  (Abstract)
  Universität Augsburg, Institut für Informatik, Report 2000-1, 2000
  Final version in: Models for Time-Critical Systems, MTCS 2000. Eds.: F. Corradini, P. Inverardi. Electronic Notes in Computer Science 39 (2000). Elsevier http://www.elsevier.nl/locate/entcs/volume39.html
• A faster-than relation for asynchronous processes. (with G. Lüttgen)
  Tech. Rep. 2001-2 , ICASE, NASA Langley Research Center, USA, 2001
  extended abstract in Proc.CONCUR 2001, LNCS 2154, 262 - 276
  Final version under the title 'Bisimulation on Speed: Worst-Case Efficiency' in Information and Computation 191 (2004) 105-144
• Partial S-Invariants for the Verification of Infinite Systems Families.
  Universität Augsburg, Institut für Informatik, Report 2001-4, 2001
  extended abstract in Applications and Theory of Petri Nets 2001, LNCS 2075, 382 - 401
• PAFAS at work: comparing the worst-case efficiency of three buffer implementations. (with F. Corradini, M. Di Berardini)
  Internal Report 1-2001 , University of L'Aquila, 2001.
  extended abstract in Proc. of Second Asia-Pacific Conference on Quality of Software APAQS 2001, Honkong, Dezember 2001. IEEE, 231-240
• Canonical Prefixes of Petri Net Unfoldings. (with V. Khomenko, M. Koutny)
  Technical Report CS-TR-741, Dept. of Computing Science, Univ. of Newcastle upon Tyne, 2001
  extended abstract in CAV 2002, LNCS 2404, 582-595
  Final version in Acta Informatica 40 (2003) 95-118
• Measuring the Performance of Asynchronous Systems with PAFAS. (with F. Corradini)
  Universität Augsburg, Institut für Informatik, Report 2002-4, 2002
  Final version to appear in Theor. Comp. Sci.
• Decomposition in Asynchronous Circuit Design. (with R. Wollowski)
  Universität Augsburg, Institut für Informatik, Report 2002-5, 2002
  extended abstract in FSTTCS 2002, LNCS 2556, 336-347
  Final version in LNCS 2549 (2002) 152-190
• Relating Fairness and Timing in Process Algebra. (with F. Corradini, M. Di Berardini)
  Research Report 03-2003 , University of L'Aquila, 2003.
  extended abstract in CONCUR 2003, LNCS 2761, 446-460