Olaf Burkart - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2001

Verification on Infinite StructuresOlaf Burkart, Didier Caucal, Faron Moller, Bernhard Steffen. In Jan A. Bergstra, Alban Ponse, Scott A. Smolka, editors, Handbook of Process Algebra. pages 545-623, North-Holland / Elsevier, 2001. [doi]

More Infinite ResultsOlaf Burkart, Javier Esparza. In Current Trends in Theoretical Computer Science. pages 480-503, 2001.

1999

Model Checking the Full Modal mu-Calculus for Infinite Sequential ProcessesOlaf Burkart, Bernhard Steffen. TCS, 221(1-2):251-270, 1999. [doi]

1998

Queues as ProcessesOlaf Burkart. ENTCS, 18:23, 1998. [doi]

1997

Model checking rationally restricted right closures of recognizable graphsOlaf Burkart. ENTCS, 9:25, 1997. [doi]

Automatic Verification of Sequential Infinite-State ProcessesOlaf Burkart. Volume 1354 of Lecture Notes in Computer Science, Springer, 1997.

Model Checking the Full Modal Mu-Calculus for Infinite Sequential ProcessesOlaf Burkart, Bernhard Steffen. icalp 1997: 419-429

More Infinite ResultsOlaf Burkart, Javier Esparza. eatcs, 62, 1997.

1996

Model-checking of infinite graphs defined by graph grammarsOlaf Burkart, Yves-Marie Quemener. ENTCS, 5:16, 1996. [doi]

Bisimulation Collapse and the Process TaxonomyOlaf Burkart, Didier Caucal, Bernhard Steffen. concur 1996: 247-262

More infinite resultsOlaf Burkart, Javier Esparza. ENTCS, 5:29, 1996. [doi]

1995

An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free ProcessesOlaf Burkart, Didier Caucal, Bernhard Steffen. mfcs 1995: 423-433

Composition, Decomposition and Model Checking of Pushdown ProcessesOlaf Burkart, Bernhard Steffen. njc, 2(2):89-125, 1995.

1994

Pushdown Processes: Parallel Composition and Model CheckingOlaf Burkart, Bernhard Steffen. concur 1994: 98-113

1992

Model Checking for Context-Free ProcessesOlaf Burkart, Bernhard Steffen. concur 1992: 123-137

Sign in or sign up to see more results.

runs on WebDSL