Dr. Astrid Kiehn

E-Mail: astrid.kiehn@bhh.hamburg.de
Telefon: 040 428 791 167

Raum E4.042
Ausschläger Weg 11
20537 Hamburg

Seit 08/2025
Vertretungsprofessur für Informatik an der Beruflichen Hochschule Hamburg

07/2023 – 07/2025
Lehrbeauftragte an der Nordakademie Elmshorn

01/2016 – 06/2021
Associate Professor am Indian Institute of Technology Mandi (IIT Mandi)

12/2008 – 12/2015
Associate Professor am Indraprastha Institute of Information Technology Delhi (IIIT-Delhi)

12/2002 – 01/2004 und 11/2004 – 04/2008
Visiting Faculty am Indian Institute of Technology Delhi (IIT Delhi)

02/1998 – 07/1998
Vertretungsprofessur an der Universität Augsburg

03/1989 – 12/1990
Research Fellow an der University of Sussex (Brighton)

07/86 – 02/1989, 01/1991 – 12/1997, 01/1991 – 12/1997, und 12/1998 – 04/2004
Wissenschaftliche Mitarbeiterin/Privatdozentin an der TU München
Kurzzeitdozentur am IIT Delhi von 12/2001 – 04/2002
Vertretungsprofessur an der TU München von 04/2001 – 09/2001

• Automaten und formale Sprachen
• Algorithmen und Datenstrukturen
• Grundlagen der Programmierung
• Computational Logic

• A. Kiehn, Sriram Kailasam: Analysis by proof and verification of an abstract algorithm for distributed irregular tree processing, Technical Report IIT Mandi, 2022.
• A. Kiehn: Studieren am IIT, die Indian Institute of Technology.  Forschung & Wissenschaft 4/19, 2019.
• A. Kiehn, M. Pattathurajan: Consistency as a branching time notion, International Conference on Theory and Applications of Models of Computation (TAMC) 2019.
• A. Kiehn, D. Aggarwal:  a study of mutable checkpointing and related algorithms, Science of Computer Programming 160, 2018.
• A. Kiehn, A. Mittal: partial snapshotting: checkpoint dissemination and termination, technical report IIT Mandi, 2018.
• D. Aggarwal, A. Kiehn, Analyzing mutable checkpointing via invariants. International Conference on Fundamentals of Software Engineering (FSEN), Lecture Notes in Computer Science 9392, 2015.
• A. Kiehn, P. Raj, P. Singh, A causal checkpointing algorithm for mobile computing environment, International Conference on Distributed Computing and Networks (ICDCN), Lecture Notes in Computer Science 8314, 2014.
• A. Kiehn. An operational semantics for shared messaging communication. Workshop on Structural Operational Semantics (SOS) 2007, Electronic Notes in Theoretical Computer Science 16735, 2007.
• A. Kiehn, S. Arun-Kumar. Amortised bisimulations, International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE) 05, LNCS 3731, 2005.
• H. Gruber, M. Holzer, A. Kiehn, B. König. On timed automata with discrete time -- structural and language theoretical characterization.  International Conference on Developments in Language Theory (DLT) 05, LNCS 3572, 2005.
• A. Kiehn, M. Hennessy. On the decidability of non-interleaving process equivalences. Fundamenta Informaticae 30(1): 18-33, 1997.
• A. Kiehn. Observing partial order runs of Petri nets. C. Freksa (ed.), Foundations of Computer Science Potential-Theory-Cognition, LNCS 1337, 1997.
• E. Esparza, A. Kiehn. On the model checking problem for branching time logics and Basic Parallel Processes. International Conference on Computer Aided Verification (CAV) 95, LNCS 939, 1995.
• A. Kiehn. Comparing locality and causality based equivalences, Acta Informatica, (31): 697-718, 1994.
• G. Boudol, I. Castellani, M. Hennessy, A. Kiehn. A theory of processes with localities, Formal Aspects of Computing 6:165-200, 1994.
• A. Kiehn, M. Hennessy. On the decidability of non-interleaving process equivalences. International Conference on Concurrency Theory (CONCUR) 94, LNCS 636, Springer-Verlag, 1994.
• G. Boudol, I. Castellani and M. Hennessy, A. Kiehn. Observing localities. Theoretical Computer Science 114:31- 61, 1993.
• A. Kiehn. Proof systems for cause based equivalences. International Symposium on Mathematical Foundations of Computer Science (MFCS) 93. LNCS 711: 547-556, 1993.
• G. Boudol, I. Castellani, M. Hennessy, A. Kiehn. A theory of processes with localities. International Conference on Concurrency Theory (CONCUR) 92, LNCS 630, Springer-Verlag, 1992.
• E. Best, R. Devillers, A. Kiehn, L. Pomello. Concurrent bisimulations in Petri nets. Acta Informatica, (28):231-264, 1991.
• G. Boudol, I. Castellani, M. Hennessy, A. Kiehn. Observing localities. International Symposium on Mathematical Foundations of Computer Science (MFCS) 91, LNCS 520. Springer-Verlag, 1991.
• A. Kiehn. Local and global causes. Technical Report TUM-I9132, Technische Universität München, 1991.
• A. Kiehn. Petri net systems and their closure properties. In G. Rozenberg, ed., Advances in Petri nets 1989, LNCS 424, pp. 306-328, Springer-Verlag, 1990.
• A. Kiehn. Infinitary partial Petri net languages and their relationship to other Petri net semantics. In G. Rozenberg, ed., Advances in Petri nets 1988, LNCS340, pp. 227-248, Springer-Verlag, 1989.
• A. Kiehn. Distributed bisimulations for finite CCS. Technical Report 7/89, University of Sussex, 1989. Abstract in Concurrency and Compositionality, extended abstracts of a workshop, TR - 5/90, University of Pisa.
• A. Kiehn. A structuring mechanism for Petri nets. Technical ReportTUM-I8902, Technische Universität München, 1989.
• A. Kiehn. On the interrelation between synchronized and non-synchronized behaviour of  Petri nets. Journal of Information Processing and Cybernetics EIK, 24(1/2): 3-18, 1988.
• A. Kiehn. On the concurrent behaviour of Petri nets. Technical Report FBI-HH-B-120/86, Universität Hamburg, 1986.