1. Comparing the expressive power of well-structured transition systems;Abdulla,2007
2. A language-based comparison of extensions of Petri nets with and without whole-place operations;Abdulla,2009
3. A classification of the expressive power of well-structured transition systems;Abdulla;Inform. and Comput.,2011
4. P.A. Abdulla, G. Delzanno, On the coverability problem for constrained multiset rewriting, in: AVIS 2006, an ETAPS Workshop, 2006.
5. Ordinal theory for the expressiveness of well structured transition systems;Bonnet,2011