Model Checking for Context-Free Processes. - Olaf Burkart; Bernhard Steffen (CONCUR, 1992)

Pushdown Processes: Parallel Composition and Model Checking. - Olaf Burkart; Bernhard Steffen (CONCUR, 1994)

An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. - Olaf Burkart; Didier Caucal; Bernhard Steffen (MFCS, 1995)

Composition, Decomposition and Model Checking of Pushdown Processes. - Olaf Burkart; Bernhard Steffen (Nord. J. Comput., 1995)

Bisimulation Collapse and the Process Taxonomy. - Olaf Burkart; Didier Caucal; Bernhard Steffen (CONCUR, 1996)

More infinite results. - Olaf Burkart; Javier Esparza (INFINITY, 1996)

Model-checking of infinite graphs defined by graph grammars. - Olaf Burkart; Yves-Marie Quemener (INFINITY, 1996)

Automatic Verification of Sequential Infinite-State Processes - Olaf Burkart (Springer, 1997)

Model checking rationally restricted right closures of recognizable graphs. - Olaf Burkart (INFINITY, 1997)

Queues as Processes. - Olaf Burkart (MFCS Workshop on Concurrency, 1998)

Model Checking the Full Modal mu-Calculus for Infinite Sequential Processes. - Olaf Burkart; Bernhard Steffen (Theor. Comput. Sci., 1999)

Verification on Infinite Structures. - Olaf Burkart; Didier Caucal; Faron Moller; Bernhard Steffen (Handbook of Process Algebra, 2001)

More Infinite Results. - Olaf Burkart; Javier Esparza (Current Trends in Theoretical Computer Science, 2001)