Theoretical Computer Science

Technical Reports

7. A Polynomial Translation of Pi-Calculus (FCP) to Safe Petri Nets, by Roland Meyer, Victor Khomenko, and Reiner Hüchting.
   Technical Report CS-TR-1323, School of Computing Science, Newcastle University, 2012.
   PDF

6. Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains, by Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio, Ernst Moritz Hahn, and Lijun Zhang.
   Technical Report 64, Sonderforschungsbereiche (SFB)/Transregio (TR) 14 AVACS, 2010.
   PDF

5. A Note on Hack's Conjecture, Parikh Images of Matrix Languages and Multiset Grammars, by Georg Zetzsche.
   Technical Report FBI-HH-B-289/09, University of Hamburg, Department of Computer Science, 2009.
   OPUS

4. Automated Checking of Observational Equivalence for an Extended Spi Calculus, by Georgel Calin, Markus Rabe, and Raphael Reischuk.
   Technical Report , Student Seminar at Saarland University, 2009.
   PDF

3. Checking pi-calculus structural congruence is graph isomorphism complete, by Victor Khomenko and Roland Meyer.
   Technical Report CS-TR-1100, School of Computing Science, Newcastle University, 2008.
   PDF | BibTeX

2. On depth and breadth in the pi-calculus, by Roland Meyer.
   Technical Report 01/08, Department of Computing Science, University of Oldenburg, 2008.
   BibTeX

1. A practical approach to verification of mobile systems using net unfoldings, by Roland Meyer, Victor Khomenko, and Tim Strazny.
   Technical Report CS-TR-1064, School of Computing Science, Newcastle University, 2008.
   PDF | BibTeX