Binary reachability analysis of discrete pushdown timed automata Z Dang, OH Ibarra, T Bultan, RA Kemmerer, J Su International Conference on Computer Aided Verification, 69-84, 2000 | 84 | 2000 |

Pushdown timed automata: a binary reachability characterization and safety verification Z Dang Theoretical Computer Science 302 (1-3), 93-121, 2003 | 66 | 2003 |

Using the ASTRAL model checker for cryptographic protocol analysis Z Dang, RA Kemmerer Proc. DIMACS Workshop on Design and Formal Verification of Security Protocols, 1997 | 61 | 1997 |

Catalytic P systems, semilinear sets, and vector addition systems OH Ibarra, Z Dang, O Egecioglu Theoretical Computer Science 312 (2-3), 379-399, 2004 | 54 | 2004 |

Counter machines and verification problems OH Ibarra, J Su, Z Dang, T Bultan, RA Kemmerer Theoretical Computer Science 289 (1), 165-189, 2002 | 50 | 2002 |

Counter machines: decidable properties and applications to verification problems OH Ibarra, J Su, Z Dang, T Bultan, R Kemmerer International Symposium on Mathematical Foundations of Computer Science, 426-435, 2000 | 47 | 2000 |

Using the ASTRAL model checker to analyze Mobile IP Z Dang, RA Kemmerer Proceedings of the 21st International Conference on Software Engineering …, 1999 | 41 | 1999 |

Binary reachability analysis of pushdown timed automata with dense clocks Z Dang International Conference on Computer Aided Verification, 506-517, 2001 | 37 | 2001 |

On stateless automata and P systems L Yang, Z Dang, OH Ibarra International Journal of Foundations of Computer Science 19 (05), 1259-1276, 2008 | 35 | 2008 |

Characterizations of catalytic membrane computing systems OH Ibarra, Z Dang, O Egecioglu, G Saxena International Symposium on Mathematical Foundations of Computer Science, 480-489, 2003 | 33 | 2003 |

Composability of infinite-state activity automata Z Dang, OH Ibarra, J Su International Symposium on Algorithms and Computation, 377-388, 2004 | 29 | 2004 |

A solvable class of quadratic diophantine equations with applications to verification of infinite-state systems G Xie, Z Dang, OH Ibarra International Colloquium on Automata, Languages, and Programming, 668-680, 2003 | 28 | 2003 |

Liveness verification of reversal-bounded multicounter machines with a free counter Z Dang, OH Ibarra, PS Pietro International Conference on Foundations of Software Technology and …, 2001 | 27 | 2001 |

On P Systems Operating in Sequential Mode. Z Dang, OH Ibarra DCFS, 164-177, 2004 | 26 | 2004 |

On the solvability of a class of diophantine equations and applications OH Ibarra, Z Dang Theoretical computer science 352 (1-3), 342-346, 2006 | 25 | 2006 |

The design and analysis of real-time systems using the ASTRAL software development environment PZ Kolano, Z Dang, RA Kemmerer Annals of Software Engineering 7 (1), 177-210, 1999 | 25 | 1999 |

Information gain of black-box testing L Yang, Z Dang, TR Fischer Formal aspects of computing 23 (4), 513-539, 2011 | 22 | 2011 |

A near-optimal protocol for the grouping problem in RFID systems X Wang, Z Liu, Y Gao, X Zheng, Z Dang, X Shen IEEE Transactions on Mobile Computing 20 (4), 1257-1272, 2019 | 21 | 2019 |

On the decidability of model-checking for P systems Z Dang, OH Ibarra, C Li, G Xie J. Autom. Lang. Comb. 11 (3), 279-298, 2006 | 21 | 2006 |

Presburger liveness verification of discrete timed automata Z Dang, P San Pietro, RA Kemmerer Theoretical Computer Science 299 (1-3), 413-438, 2003 | 19 | 2003 |