Karsten Schmidt

Zimmer :              RUD 25, Raum 4/4/12
Telefon:              (+49) (30) 2093 3083
Sprechzeiten:         Di, 14-17 Uhr im Büro,
                      sonst nach Vereinbarung (e-mail bevorzugt) 
E-mail :              kschmidt@informatik.hu-berlin.de 

Lehre (im WS 2003/04)

• Übung zu Praktische Informatik I

Lehre (im SS 2003)

• Halbkurs Computergestützte Verifikation
• Proseminar Programmverifikation
• Seminar Prozessalgebra

Forschungsgebiet: Computergestützte Verifikation verteilter Systeme

• Petrinetze
• Explizite Zustandsraumanalyse mit leistungsfähigen Reduktionstechniken für Low-Level-Petrietze: LoLA
• Verifikation von Real-Time-Systemen
• Verifikation von Web-Services

Schriften und Vorträge

Pflichtarbeiten

• Karsten Schmidt: Implementation der Umgebung eines Programms zur Prüfung und Berechnung von Invarianten algebraischer Petri-Netze . Diplomarbeit. Humboldt-Universität zu Berlin, Fachbereich Informatik (1993). 82 Seiten.
• Karsten Schmidt: Symbolische Analysemethoden für algebraische Petri-Netze. Dissertation. Humboldt-Universität zu Berlin, Math. Nat. Fakultät II (1996). Erschienen im Dieter Bertz Verlag. 246 Seiten. ISBN 3-929470-54-3.
• Karsten Schmidt: Explicit State Space Verification. Habilitationsschrift. Humboldt-Universität zu Berlin, Math. Nat. Fakultät II (2002).

Publikationen in Zeitschriften (begutachtet)

• Karsten Schmidt: Modelchecking with Coverability Graphs. Formal Methods in System Design 15 (3), 1999, pp 239-254
• Karsten Schmidt: How to Calculate Symmetries of Petri nets. Acta Informatica 36, 2000, pp 545-590
• Karsten Schmidt: Stubborn Sets for Modelchecking the EF/AG Fragment of CTL. Fundamenta Informaticae 43(1-4), 2000, pp 331-341
• Karsten Schmidt: Narrowing Petri net State Spaces using the State Equation. Fundamenta Informaticae 47 (3,4), 2001, pp 325-335
• Karsten Schmidt: Distributed Verification with LoLA. Fundamenta Informaticae 54 (2-3), 2003, pp 253 - 262.

Konferenzbeiträge (mit Begutachtungsprozess)

• Karsten Schmidt: On the Computation of Place Invariants for Algebraic Petri Nets. In J. Desel (Ed.): Workshop on Structures in Concurrency Theory (STRICT), Berlin (1995), pp. 310-325. Workshops in Computing. Springer.
• Karsten Schmidt: Parameterized Reachability Trees for Algebraic Petri Nets. In G. de Michelis, M. Diaz (Eds.): Proc. 16th Int. Conf. Application and Theory of Petri Nets, Torino, Italy (1995), pp. 392-411. Lecture Notes in Computer Science 935, Springer.
• Karsten Schmidt: Siphons, Traps, and High-Level nets with Infinite Color Domains. In P. Azema, G. Balbo (Eds.): Proc. 18th Int. Conf. Application and Theory of Petri Nets, Toulouse, France (1997), pp. 271-289. Lecture Notes in Computer Science 1248, Springer.
• Karsten Schmidt: Verification of Siphons and Traps for Algebraic Petri nets. In P. Azema, G. Balbo (Eds.): Proc. 18th Int. Conf. Application and Theory of Petri Nets, Toulouse, France (1997), S. 427-446. Lecture Notes in Computer Science 1248, Springer.
• Karsten Schmidt: Stubborn Sets for Standard Properties. In S. Donatelli, H.C.M. Kleijn (Eds.): Proc. 20th Int. Conf. Application and Theory of Petri Nets, Williamsburg, Virginia (1999), pp. 46-65. Lecture Notes in Computer Science 1639, Springer.
• Karsten Schmidt: Integrating Low level Symmetries into Reachability Analysis. In S. Graf, M. Schwartzbach (Eds.): Proc. 6th International Conference Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Berlin, Germany (2000), pp. 315-331. Lecture Notes in Computer Science 1785, Springer.
• Karsten Schnidt: LoLA: A Low Level Analyser. In M. Nielsen, D. Simpson (Eds.): Proc. 21th Int. Conf. Application and Theory of Petri Nets, Aarhus, Denmark (2000), pp. 465-474. Lecture Notes in Computer Science 1825, Springer.
• Farn Wang und Karsten Schmidt: Symbolic Safety-Analysis of Concurrent Software with Pointer Data Structure. Proc. Int. Conf. Formal Techniques for Networked and Distributed Systems (FORTE 2002), pp. 50-64 Lecture Notes in Computer Science 2529, Springer.
• Karsten Schmidt: Using Petri net Invariants in State Space Construction. Proc. 9th Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS) 2003, pp. 473-488 Lecture Notes in Computer Science 2619, Springer.

Beiträge auf Workshops (ohne Begutachtung); technische Berichte

• Karsten Schmidt: Symmetries of Petri Nets. Workshop Concurrency, Specification and Programming, Berlin (1992). In: Petri Net Newsletter 43 (1993), pp. 9-25.
• Karsten Schmidt: Computation of Invariants for Algebraic Petri Nets. In H.-D. Burkhard, L. Czaja, P. Starke (Eds.): Workshop on Concurrency, Specification and Programming, Nieborow (1993), pp. 196-218.
• Karsten Schmidt: Symbolische Analysemethoden für algebraische Petri-Netze. In J. Desel, A. Oberweis, W. Reisig (Eds.): Workshop Algorithmen und Werkzeuge für Petrinetze, Berlin (1994), pp. 55-60.
• Karsten Schmidt: Parameterized Reachability Trees for Algebraic Petri Nets. In L. Czaja, H,-D. Burkhard, P. Starke (Eds.): Workshop Concurrency, Specification and Programming, Berlin (1994), pp. 90-99.
• Karsten Schmidt: Symmetry Calculation. Workshop on Concurrency, Specification and Programming, Warsaw (1995). pp. 147 - 162
• Karsten Schmidt: Symmetrieberechnung. Workshop Algorithmen und Werkzeuge für Petri-Netze, Oldenburg (1995).
• Karsten Schmidt: Siphons and Traps for Algebraic Petri nets. Workshop on Concurrency, Specification and Programming, Berlin (1996). pp. 157-168.
• Karsten Schmidt: Ein Verfahren zur Verifikation von "Immer möglich" und "Möglich, daß immer"-Eigenschaften. Workshop Algorithmen und Werkzeuge für Petrinetze, Karlsruhe (1996).
• Karsten Schmidt: Modelchecking with Coverability Graphs. Workshop on Concurrency, Specification and Programming, Warsaw (1997). pp. 112-123.
• Karsten Schmidt: Modelchecking on Symbolic Reachability Graphs of Petri nets. Workshop Algorithmen und Werkzeuge für Petrinetze, Berlin (1997). pp. 43-48.
• Karsten Schmidt: Goal-Oriented Stubborn Sets. Workshop on Concurrency, Specification and Programming, Berlin (1998). pp. 204-213.
• Klaus-Peter Neuendorf, Karsten Schmidt, Dimitris Kiritsis, Paul Xirouchakis: Workflow Modelling and Analysis with Chameleon Nets. Workshop on Concurrency, Specification and Programming, Berlin (1998). pp. 156-161.
• Karsten Schmidt: Symmetrien in der Erreichbarkeitsanalyse. Workshop Algorithmen und Werkzeuge für Petrinetze, Dortmund (1998). pp. 101 - 106
• Karsten Schmidt: Stubborn Sets for Modelchecking the EF/AG-Fragment of CTL. Workshop on Concurrency, Specification and Programming, Warsaw (1999). pp. 204-213.
• Karsten Schmidt: LoLA wird Pfadfinder. Workshop Algorithmen und Werkzeuge für Petrinetze, Frankfurt (1999). pp. 48-53.
• Karsten Schmidt: Flexible net Inscriptions with LoLA. Petri Net Newsletter 59 (2000), pp 30-44.
• Karsten Schmidt: Narrowing the state space of Petri nets using the state equation. Workshop on Concurrency, Specification and Programming, Berlin (2000).
• Karsten Schmidt: Using invariants for state space reduction. Workshop on Concurrency, Specification and Programming, Warsaw (2001).
• Karsten Schmidt: Symmetries of Petri Nets. Informatik-Bericht 33, Humboldt-Universität zu Berlin (1994)
• Karsten Schmidt und Peter Starke: An Algorithm to Compute the Symmetries of Petri Nets. In: Petri Net Newsletter 40 (1991), pp. 25-30.
• Karsten Schmidt: T-Invariants of Algebraic Petri Nets. Informatik-Bericht 31, Humboldt-Universität zu Berlin (1994).
• Karsten Schmidt: How to Calculate Symbolically Siphons and Traps of Algebraic Petri Nets. Technical Report A39 of Helsinki University of Technology (1996).
• Karsten Schmidt: Applying Reduction Rules to Algebraic Petri nets. Technical Report A44 of Helsinki University of Technology (1997).
• Karsten Schmidt: Model Checking on Symbolic Reachability Graphs of Petri nets. Technical Report MATH-AL-10-1997, Dresden University of Technology (1997).
• Karsten Schmidt: Integrating Low Level Symmetries into Reachability Analysis. Informatik-Bericht 122, Humboldt-Universität zu Berlin (1999)

Karsten Schmidt
Erstellt am 21-10-94, zuletzt geändert am 08-10-01