 | 2011 |
|---|
| 9 |       | Harrie Jan Sander Bruggink,
Raphaël Cauderlier,
Mathias Hülsbusch,
Barbara König:
Conditional Reactive Systems.
FSTTCS 2011: 191-203 |
| 8 | | Harrie Jan Sander Bruggink,
Mathias Hülsbusch:
Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages.
ECEASST 41: (2011) |
| 7 | | Christoph Blume,
Harrie Jan Sander Bruggink,
Martin Friedrich,
Barbara König:
Treewidth, Pathwidth and Cospan Decompositions.
ECEASST 41: (2011) |
| 2010 |
|---|
| 6 | | Harrie Jan Sander Bruggink,
Barbara König:
A Logic on Subobjects and Recognizability.
IFIP TCS 2010: 197-212 |
| 5 | | Christoph Blume,
Harrie Jan Sander Bruggink,
Barbara König:
Recognizable Graph Languages for Checking Invariants.
ECEASST 29: (2010) |
| 2008 |
|---|
| 4 | | Harrie Jan Sander Bruggink,
Barbara König:
On the Recognizability of Arrow and Graph Languages.
ICGT 2008: 336-350 |
| 3 | | Harrie Jan Sander Bruggink:
Towards a Systematic Method for Proving Termination of Graph Transformation Systems.
Electr. Notes Theor. Comput. Sci. 213(1): 23-38 (2008) |
| 2006 |
|---|
| 2 | | Harrie Jan Sander Bruggink:
A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property.
RTA 2006: 372-386 |
| 2003 |
|---|
| 1 | | Harrie Jan Sander Bruggink:
Residuals in Higher-Order Rewriting.
RTA 2003: 123-137 |
Data released under the ODC-BY 1.0 license — See also our legal information page