 | 2001 |
|---|
| 14 |       | Olaf Burkart,
Javier Esparza:
More Infinite Results.
Current Trends in Theoretical Computer Science 2001: 480-503 |
| 1999 |
|---|
| 13 |  | Olaf Burkart,
Bernhard Steffen:
Model Checking the Full Modal mu-Calculus for Infinite Sequential Processes.
Theor. Comput. Sci. 221(1-2): 251-270 (1999) |
| 1998 |
|---|
| 12 | | Olaf Burkart:
Queues as Processes.
Electr. Notes Theor. Comput. Sci. 18: (1998) |
| 1997 |
|---|
| 11 | | Olaf Burkart:
Automatic Verification of Sequential Infinite-State Processes
Springer 1997 |
| 10 | | Olaf Burkart,
Bernhard Steffen:
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes.
ICALP 1997: 419-429 |
| 9 | | Olaf Burkart,
Javier Esparza:
More Infinite Results.
Bulletin of the EATCS 62: (1997) |
| 8 | | Olaf Burkart:
Model checking rationally restricted right closures of recognizable graphs.
Electr. Notes Theor. Comput. Sci. 9: (1997) |
| 1996 |
|---|
| 7 | | Olaf Burkart,
Didier Caucal,
Bernhard Steffen:
Bisimulation Collapse and the Process Taxonomy.
CONCUR 1996: 247-262 |
| 6 | | Olaf Burkart,
Yves-Marie Quemener:
Model-checking of infinite graphs defined by graph grammars.
Electr. Notes Theor. Comput. Sci. 5: (1996) |
| 5 | | Olaf Burkart,
Javier Esparza:
More infinite results.
Electr. Notes Theor. Comput. Sci. 5: (1996) |
| 1995 |
|---|
| 4 | | Olaf Burkart,
Didier Caucal,
Bernhard Steffen:
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes.
MFCS 1995: 423-433 |
| 3 | | Olaf Burkart,
Bernhard Steffen:
Composition, Decomposition and Model Checking of Pushdown Processes.
Nord. J. Comput. 2(2): 89-125 (1995) |
| 1994 |
|---|
| 2 | | Olaf Burkart,
Bernhard Steffen:
Pushdown Processes: Parallel Composition and Model Checking.
CONCUR 1994: 98-113 |
| 1992 |
|---|
| 1 | | Olaf Burkart,
Bernhard Steffen:
Model Checking for Context-Free Processes.
CONCUR 1992: 123-137 |
