The following pages link to H. J. Sander Bruggink (Q2911623):
Displaying 13 items.
- Conditional Reactive Systems (Q2911624) (← links)
- Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking (Q2918989) (← links)
- Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings (Q2947210) (← links)
- A Logic on Subobjects and Recognizability (Q3163884) (← links)
- Termination Analysis for Graph Transformation Systems (Q3190160) (← links)
- Towards Process Mining with Graph Transformation Systems (Q3192242) (← links)
- A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property (Q3527309) (← links)
- On the Recognizability of Arrow and Graph Languages (Q3540409) (← links)
- (Q4447227) (← links)
- Recognizable languages of arrows and cospans (Q4585008) (← links)
- A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java (Q5100741) (← links)
- Termination of Cycle Rewriting (Q5170838) (← links)
- Towards a Systematic Method for Proving Termination of Graph Transformation Systems (Q5403457) (← links)
