CHRISTIAN EISENTRAUT



I am a Ph.D student at the chair of Holger Hermanns since summer 2007. My work is supported by the German Research Foundation (DFG) as part of the graduate school "Leistungsgarantien für Rechnersysteme".


Contact

Whenever you feel like getting in touch with me, come and see me in

Room

511.1

Building

E1.3

Phone

0049-681/302-5624

or send an e-mail to:




Current Research

My main research interest lies in the formal verification and analysis of concurrent systems.

I am currently working both on formal theories for memory models and on models incorporating interactive, non-deterministic, and both discrete and continuous Markovian behaviour.

 

Besides researching concurrency theory, I am also actively interested in teaching concurrency theory. Holger Hermanns and I have ventured to teach concurrency theory right in their first year of study. We now continue this effort in our basic course "Concurrent Programming", which makes concurrency theory (CCS, bisimulation and all that) meet practice (Java, locking, memory models).


Teaching


Publications

On Probabilistic Automata in Continuous Time, C. Eisentraut and H. Hermanns and L. Zhang, LICS 2010 (accepted for publication)
Teaching Concurrency Concepts to Freshmen, C. Eisentraut and H. Hermanns, in Transactions on Petri Nets and Other Models of Concurrency I, 2008, p. 35-53, Springer-Verlag,Berlin, Heidelberg
FCT handling in BPEL 2.0 - A comparative analysis, C. Eisentraut and D. Spieler, WS-FM'08
Teaching Concurrency to Freshmen, C. Eisentraut and H. Hermanns, Proceedings of "TeaConc'2007"
Complete completeness for weak bisimulation semantics, C. Eisentraut, Master thesis, Saarland University, 2007
Strongly convergent weak bisimulation congruence, C. Eisentraut, Bachelor thesis, Saarland University, 2006