On diaginalizations over complexity classes. - Hans Fleischhack (1985)

P-Genericity and Strong G-Genericity. - Hans Fleischhack (MFCS, 1986)

Diagonalizing over Deterministic Polynomial Time. - Klaus Ambos-Spies; Hans Fleischhack; Hagen Huwig (CSL, 1987)

Diagonalizations over Polynomial Time Computable Sets. - Klaus Ambos-Spies; Hans Fleischhack; Hagen Huwig (Theor. Comput. Sci., 1987)

P-Superfairness in Nets. - Hans Fleischhack (Application and Theory of Petri Nets, 1992)

A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2. - Eike Best; Hans Fleischhack; Wojciech Fraczak; Richard P. Hopkins; Hanna Klaudel; Elisabeth Pelz (Application and Theory of Petri Nets, 1995)

Computing Petri Net Languages by Reductions. - Anja Gronewold; Hans Fleischhack (FCT, 1995)

An M-net Semantics of B(PN)2. - Eike Best; Hans Fleischhack; Wojciech Fraczak; Richard P. Hopkins; Hanna Klaudel; Elisabeth Pelz (STRICT, 1995)

An M-Net Semantics for a Real-Time Extension of µSDL. - Hans Fleischhack; Josef Tapken (FME, 1997)

A Petri Net Semantics for B(PN)2 with Procedures. - Bernd Grahlmann; Hans Fleischhack (PDSE, 1997)

A Compositional Petri Net Semantics for SDL. - Hans Fleischhack; Bernd Grahlmann (ICATPN, 1998)

Towards Compositional Verification of SDL Systems. - Bernd Grahlmann; Hans Fleischhack (HICSS (7), 1998)

Model Checking of Time Petri Nets Based on Partial Order Semantics. - Burkhard Bieber; Hans Fleischhack (CONCUR, 1999)

Computing a Finite Prefix of a Time Petri Net. - Hans Fleischhack; Christian Stehno (ICATPN, 2002)

Compositional High Level Petri Nets with Timing Constraints - A Comparison. - Elisabeth Pelz; Hans Fleischhack (ACSD, 2003)

Hierarchical Timed High Level Nets and Their Branching Processes. - Hans Fleischhack; Elisabeth Pelz (ICATPN, 2003)

Compositional Semantics for UML 2.0 Sequence Diagrams Using Petri Nets. - Christoph Eichner; Hans Fleischhack; Roland Meyer 001; Ulrik Schrimpf; Christian Stehno (SDL Forum, 2005)