Binary reachability analysis of discrete pushdown timed automata Z Dang, OH Ibarra, T Bultan, RA Kemmerer, J Su Computer Aided Verification: 12th International Conference, CAV 2000 …, 2000 | 89 | 2000 |

Pushdown timed automata: a binary reachability characterization and safety verification Z Dang Theoretical Computer Science 302 (1-3), 93-121, 2003 | 70 | 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 | 64 | 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 | 52 | 2004 |

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

Counter machines: decidable properties and applications to verification problems OH Ibarra, J Su, Z Dang, T Bultan, R Kemmerer Mathematical Foundations of Computer Science 2000: 25th International …, 2000 | 49 | 2000 |

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

Binary reachability analysis of pushdown timed automata with dense clocks Z Dang Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001 | 38 | 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 | 34 | 2008 |

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

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 | 32 | 2003 |

A solvable class of quadratic diophantine equations with applications to verification of infinite-state systems G Xie, Z Dang, OH Ibarra Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003 | 30 | 2003 |

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

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 | 29 | 2001 |

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

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-4), 177-210, 1999 | 26 | 1999 |

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 | 24 | 2019 |

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

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 | 23 | 2006 |

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