Entwicklung korrekter Systeme

Jun.-Prof. Dr. Roland Meyer

E-Mail: Roland.Meyer

Seit Juli 2010 ist Roland Meyer Juniorprofessor für Theoretische Informatik und Leiter der Arbeitsgruppe Concurrency Theory an der Technischen Universität Kaiserslautern. Hier geht es zur neuen Webseite.

Foto

 


zum Seitenanfang

Curriculum Vitae

since 10/2005 PhD student and scholarship holder at the DFG-Graduate School TrustSoft
09/2005 Diploma (MSc.) degree (with honors) in Computer Science
10/2001-09/2005 Studies of Computer Science and Mathematics at the University of Oldenburg
09/2000-06/2001 Military Service
06/2000 Abitur at the Gymnasium Westerstede
02/1981 Born in Leer, Germany


zum Seitenanfang

Projekte

Projekte, an denen ich beteiligt bin, oder mit denen ich zusammenarbeite:
  • TrustSoft (Trustworthy Software Systems)
  • AVACS (Automatic Verification and Analysis of Complex Systems)
  • DAVAC (Design and Verification of Asynchronous Circuits)

zum Seitenanfang

Werkzeuge


zum Seitenanfang

Forschungsbesuche

  • November/Dezember 2007: Aufenthalt bei der Modelling and Reasoning Group, University of Newcastle, Newcastle upon Tyne, England, auf Einladung von Prof. Dr. Maciej Koutny.
  • März 2006: Aufenthalt bei der Distributed Systems Research Group, Charles University, Prag, Tschechien, auf Einladung von Prof. Dr. Frantisek Plasil.

zum Seitenanfang

Vorträge

  • Dezember 2007: Vortrag im Seminar des Laboratory for Foundations of Computer Science (LFCS Seminar) der University of Edinburgh, Edinburgh, Schottland, Gastgeber Reader Dr. Julian Bradfield. Titel "A Petri Net Semantics for Pi-Calculus Verification".
  • November 2007: Vortrag im Seminar des Asynchronous Systems Labs (ASL-Seminar) der University of Newcastle, Newcastle upon Tyne, England, Gastgeber Prof. Dr. Maciej Koutny und Prof. Dr. Alex Yakovlev. Titel "A Petri Net Semantics for Pi-Calculus Verification".

zum Seitenanfang

Publikationen

[MS10]
R. Meyer and T. Strazny. Petruchio: From dynamic networks to nets. In Tayssir Touili, Byron Cook, and Paul Jackson, editors, Proceedings of the 22nd International Conference on Computer Aided Verification 2010, CAV 2010, volume 6174 of LNCS, pages 175-179. Springer-Verlag, 2010.
[ bib | Abstract ]
[OM09]
E.-R. Olderog and R. Meyer. Automata-theoretic verification based on counterexample specification. In V. Diekert, K. Weicker, and N. Weicker, editors, Informatik als Dialog zwischen Theorie und Anwendung, pages 217-225. Vieweg-Teubner, 2009.
[ bib ]
[KM08]
V. Khomenko and R. Meyer. Checking π-calculus structural congruence is graph isomorphism complete. Technical Report CS-TR: 1100, School of Computing Science, Newcastle University, 2008. 20 pages.
[ bib | http | Abstract ]
[MFHR08]
R. Meyer, J. Faber, J. Hoenicke, and A. Rybalchenko. Model checking duration calculus: A practical approach. Formal Aspects of Computing, 20(4-5):481-505, July 2008. ISSN 0934-5043 (Print) 1433-299X (Online).
[ bib | .pdf | Abstract ]
[Mey08]
R. Meyer. On boundedness in depth in the π-calculus. In Proc. of the 5th IFIP International Conference on Theoretical Computer Science, IFIP TCS 2008, volume 273 of IFIP. Springer-Verlag, 2008. To appear.
[ bib | Abstract ]
[MKS09]
R. Meyer, V. Khomenko, and T. Strazny. A practical approach to verification of mobile systems using net unfoldings. Fundamenta Informaticae, 94(3-4):439-471, 2009. Special Issue on Petri Nets 2008, invited version of the ATPN 2008 paper.
[ bib | Abstract ]
[MKS08a]
R. Meyer, V. Khomenko, and T. Strazny. A practical approach to verification of mobile systems using net unfoldings. In Proc. of the 29th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency, ATPN 2008, volume 5062 of LNCS, pages 327-347. Springer-Verlag, 2008.
[ bib | Abstract ]
[MKS08b]
R. Meyer, V. Khomenko, and T. Strazny. A practical approach to verification of mobile systems using net unfoldings. Technical Report CS-TR: 1064, School of Computing Science, Newcastle University, January 2008. 29 pages.
[ bib | Abstract ]
[Mey07]
R. Meyer. A Petri Net Semantics for π-Calculus Verification. In Dagstuhl ''zehn plus eins'', pages 76-77. Verlagshaus Mainz GmbH Aachen, 2007.
[ bib ]
[MFR06]
R. Meyer, J. Faber, and A. Rybalchenko. Model checking duration calculus: A practical approach. In K. Barkaoui, A. Cavalcanti, and A. Cerone, editors, Theoretical Aspects of Computing - ICTAC 2006, volume 4281 of LNCS, pages 332-346, 2006. This publication is available at SpringerLink.
[ bib | .pdf | Abstract ]
[Mey06a]
R. Meyer. Model checking the π-calculus. In Proceedings of the International Research Training Groups Workshop, volume 3 of Trustworthy Software Systems, page 15. GITO, 2006.
[ bib ]
[FM06]
J. Faber and R. Meyer. Model checking data-dependent real-time properties of the european train control system. In Formal Methods in Computer Aided Design, 2006. FMCAD '06, pages 76-77. IEEE Computer Society Press, November 2006. This publication is available free of charge at IEEE Digital Library.
[ bib | Abstract ]
[Mey06b]
R. Meyer. Model checking using testing. In W. Hasselbring and S. Giesecke, editors, Dependability Engineering, volume 2 of Trustworthy Software Systems, pages 147-171. GITO, 2006.
[ bib ]
[EFM+05]
C. Eichner, H. Fleischhack, R. Meyer, U. Schrimpf, and C. Stehno. Compositional semantics for uml 2.0 sequence diagrams using petri nets. In SDL 2005: Model Driven, volume 3530 of LNCS, pages 133-148. Springer-Verlag, 2005.
[ bib ]

zum Seitenanfang

Abschlussarbeiten

[Mey05]
R. Meyer. Model-Checking von Phasen-Event-Automaten bezüglich Duration Calculus Formeln mittels Testautomaten. Master's thesis, University of Oldenburg, 2005.
[ bib ]