| 2008 |
|---|
| 58 | EE | Linmin Yang,
Yong Wang,
Zhe Dang:
Automata on Multisets of Communicating Objects.
UC 2008: 242-257 |
| 57 | EE | Oscar H. Ibarra,
Zhe Dang,
Linmin Yang:
On Counter Machines, Reachability Problems, and Diophantine Equations.
Int. J. Found. Comput. Sci. 19(4): 919-934 (2008) |
| 56 | EE | Linmin Yang,
Zhe Dang,
Oscar H. Ibarra:
On Stateless Automata and P Systems.
Int. J. Found. Comput. Sci. 19(5): 1259-1276 (2008) |
| 2007 |
|---|
| 55 | EE | Linmin Yang,
Zhe Dang,
Oscar H. Ibarra:
Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing.
UC 2007: 226-241 |
| 2006 |
|---|
| 54 | | Oscar H. Ibarra,
Zhe Dang:
Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings
Springer 2006 |
| 53 | EE | Shuohao Zhang,
Curtis E. Dyreson,
Zhe Dang:
Compacting XML Data.
DASFAA 2006: 767-776 |
| 52 | EE | Cheng Li,
Zhe Dang:
Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems.
FATES/RV 2006: 100-114 |
| 51 | EE | Oscar H. Ibarra,
Sara Woodworth,
Hsu-Chun Yen,
Zhe Dang:
On the Computational Power of 1-Deterministic and Sequential P Systems.
Fundam. Inform. 73(1-2): 133-152 (2006) |
| 50 | | Zhe Dang,
Oscar H. Ibarra,
Cheng Li,
Gaoyan Xie:
On the Decidability of Model-Checking for P Systems.
Journal of Automata, Languages and Combinatorics 11(3): 279-298 (2006) |
| 49 | EE | Oscar H. Ibarra,
Zhe Dang:
On the solvability of a class of diophantine equations and applications.
Theor. Comput. Sci. 352(1-3): 342-346 (2006) |
| 2005 |
|---|
| 48 | EE | Oscar H. Ibarra,
Sara Woodworth,
Hsu-Chun Yen,
Zhe Dang:
On Sequential and 1-Deterministic P Systems.
COCOON 2005: 905-914 |
| 47 | EE | Gaoyan Xie,
Zhe Dang:
Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach.
FATES 2005: 170-186 |
| 46 | EE | Cheng Li,
Zhe Dang,
Oscar H. Ibarra,
Hsu-Chun Yen:
Signaling P Systems and Verification Problems.
ICALP 2005: 1462-1473 |
| 45 | EE | Zhe Dang,
Oscar H. Ibarra,
Cheng Li,
Gaoyan Xie:
On Model-Checking of P Systems.
UC 2005: 82-93 |
| 44 | EE | Oscar H. Ibarra,
Sara Woodworth,
Hsu-Chun Yen,
Zhe Dang:
On Symport/Antiport P Systems and Semilinear Sets.
Workshop on Membrane Computing 2005: 253-271 |
| 43 | EE | Gaoyan Xie,
Zhe Dang:
Testing Systems of Concurrent Black-boxes - an Automata-Theoretic and Decompositional Approach
CoRR abs/cs/0502040: (2005) |
| 42 | EE | Oscar H. Ibarra,
Hsu-Chun Yen,
Zhe Dang:
On various notions of parallelism in P Systems.
Int. J. Found. Comput. Sci. 16(4): 683-705 (2005) |
| 41 | EE | Zhe Dang,
Oscar H. Ibarra:
On one-membrane P systems operating in sequential mode.
Int. J. Found. Comput. Sci. 16(5): 867-881 (2005) |
| 40 | EE | Zhe Dang,
Oscar H. Ibarra,
Zhi-Wei Sun:
On two-way nondeterministic finite automata with one reversal-bounded counter.
Theor. Comput. Sci. 330(1): 59-79 (2005) |
| 39 | EE | Zhe Dang,
Oscar H. Ibarra,
Jianwen Su:
On composition and lookahead delegation of e-services modeled by automata, .
Theor. Comput. Sci. 341(1-3): 344-363 (2005) |
| 2004 |
|---|
| 38 | EE | Gaoyan Xie,
Cheng Li,
Zhe Dang:
Testability of Oracle Automata.
CIAA 2004: 331-332 |
| 37 | EE | Oscar H. Ibarra,
Hsu-Chun Yen,
Zhe Dang:
The Power of Maximal Parallelism in P Systems.
Developments in Language Theory 2004: 212-224 |
| 36 | EE | Gaoyan Xie,
Zhe Dang:
An Automata-Theoretic Approach for Model-Checking Systems with Unspecified Components.
FATES 2004: 155-169 |
| 35 | EE | Zhe Dang,
Oscar H. Ibarra,
Pierluigi San Pietro,
Gaoyan Xie:
Real-Counter Automata and Their Decision Problems.
FSTTCS 2004: 198-210 |
| 34 | EE | Zhe Dang,
Oscar H. Ibarra,
Jianwen Su:
Composability of Infinite-State Activity Automata.
ISAAC 2004: 377-388 |
| 33 | EE | Gaoyan Xie,
Zhe Dang:
Model-checking Driven Black-box Testing Algorithms for Systems with Unspecified Components
CoRR cs.SE/0404037: (2004) |
| 32 | EE | Oscar H. Ibarra,
Zhe Dang:
On two-way FA with monotonic counters and quadratic Diophantine equations.
Theor. Comput. Sci. 312(2-3): 359-378 (2004) |
| 31 | EE | Oscar H. Ibarra,
Zhe Dang,
Ömer Egecioglu:
Catalytic P systems, semilinear sets, and vector addition systems.
Theor. Comput. Sci. 312(2-3): 379-399 (2004) |
| 30 | EE | Zhe Dang,
Tevfik Bultan,
Oscar H. Ibarra,
Richard A. Kemmerer:
Past pushdown timed automata and safety verification.
Theor. Comput. Sci. 313(1): 57-71 (2004) |
| 2003 |
|---|
| 29 | | Oscar H. Ibarra,
Zhe Dang:
Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings
Springer 2003 |
| 28 | EE | Gaoyan Xie,
Zhe Dang,
Oscar H. Ibarra,
Pierluigi San Pietro:
Dense Counter Machines and Verification Problems.
CAV 2003: 93-105 |
| 27 | EE | Gaoyan Xie,
Cheng Li,
Zhe Dang:
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations.
CIAA 2003: 163-175 |
| 26 | EE | Pierluigi San Pietro,
Zhe Dang:
Automatic Verification of Multi-queue Discrete Timed Automata.
COCOON 2003: 159-171 |
| 25 | EE | Gaoyan Xie,
Zhe Dang,
Oscar H. Ibarra:
A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems.
ICALP 2003: 668-680 |
| 24 | EE | Oscar H. Ibarra,
Zhe Dang,
Ömer Egecioglu,
Gaurav Saxena:
Characterizations of Catalytic Membrane Computing Systems.
MFCS 2003: 480-489 |
| 23 | EE | Zhe Dang,
Pierluigi San Pietro,
Richard A. Kemmerer:
Presburger liveness verification of discrete timed automata.
Theor. Comput. Sci. 1-3(299): 413-438 (2003) |
| 22 | EE | Oscar H. Ibarra,
Zhe Dang:
Eliminating the storage tape in reachability constructions.
Theor. Comput. Sci. 1-3(299): 687-706 (2003) |
| 21 | | Oscar H. Ibarra,
Zhe Dang,
Pierluigi San Pietro:
Verification in loosely synchronous queue-connected discrete timed automata.
Theor. Comput. Sci. 290(3): 1713-1735 (2003) |
| 20 | EE | Zhe Dang,
Oscar H. Ibarra,
Richard A. Kemmerer:
Generalized discrete timed automata: decidable approximations for safety verificatio.
Theor. Comput. Sci. 296(1): 59-74 (2003) |
| 19 | EE | Zhe Dang:
Pushdown timed automata: a binary reachability characterization and safety verification.
Theor. Comput. Sci. 302(1-3): 93-121 (2003) |
| 2002 |
|---|
| 18 | EE | Oscar H. Ibarra,
Zhe Dang,
Zhi-Wei Sun:
Safety Verification for Two-Way Finite Automata with Monotonic Counters.
Developments in Language Theory 2002: 326-338 |
| 17 | EE | Zhe Dang,
Oscar H. Ibarra,
Zhi-Wei Sun:
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter.
ISAAC 2002: 103-114 |
| 16 | EE | Zhe Dang,
Oscar H. Ibarra:
The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications.
Int. J. Found. Comput. Sci. 13(6): 911-936 (2002) |
| 15 | | Oscar H. Ibarra,
Jianwen Su,
Zhe Dang,
Tevfik Bultan,
Richard A. Kemmerer:
Counter Machines and Verification Problems.
Theor. Comput. Sci. 289(1): 165-189 (2002) |
| 2001 |
|---|
| 14 | EE | Zhe Dang:
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks.
CAV 2001: 506-518 |
| 13 | EE | Zhe Dang,
Tevfik Bultan,
Oscar H. Ibarra,
Richard A. Kemmerer:
Past Pushdown Timed Automata.
CIAA 2001: 74-86 |
| 12 | EE | Zhe Dang,
Oscar H. Ibarra,
Richard A. Kemmerer:
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata.
COCOON 2001: 529-539 |
| 11 | EE | Zhe Dang,
Oscar H. Ibarra,
Pierluigi San Pietro:
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter.
FSTTCS 2001: 132-143 |
| 10 | EE | Oscar H. Ibarra,
Zhe Dang:
On Removing the Pushdown Stack in Reachability Constructions.
ISAAC 2001: 244-256 |
| 9 | EE | Zhe Dang,
Pierluigi San Pietro,
Richard A. Kemmerer:
On Presburger Liveness of Discrete Timed Automata.
STACS 2001: 132-143 |
| 8 | EE | Zhe Dang:
Pushdown Timed Automata: a Binary Reachability Characterization and Safety Verification
CoRR cs.LO/0110010: (2001) |
| 7 | EE | Zhe Dang:
The Existence of $\omega$-Chains for Transitive Mixed Linear Relations and Its Applications
CoRR cs.LO/0110063: (2001) |
| 2000 |
|---|
| 6 | | Zhe Dang,
Oscar H. Ibarra,
Tevfik Bultan,
Richard A. Kemmerer,
Jianwen Su:
Binary Reachability Analysis of Discrete Pushdown Timed Automata.
CAV 2000: 69-84 |
| 5 | EE | Zhe Dang,
Richard A. Kemmerer:
Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems.
ICSE 2000: 345-354 |
| 4 | EE | Oscar H. Ibarra,
Jianwen Su,
Zhe Dang,
Tevfik Bultan,
Richard A. Kemmerer:
Conter Machines: Decidable Properties and Applications to Verification Problems.
MFCS 2000: 426-435 |
| 1999 |
|---|
| 3 | EE | Zhe Dang,
Richard A. Kemmerer:
Using the ASTRAL Model Checker to Analyze Mobile IP.
ICSE 1999: 132-142 |
| 2 | EE | Zhe Dang,
Richard A. Kemmerer:
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications.
RTCSA 1999: 174-181 |
| 1 | | Paul Z. Kolano,
Zhe Dang,
Richard A. Kemmerer:
The Design and Analysis of Real-Time Systems Using the ASTRAL Software Development Environment.
Ann. Software Eng. 7: 177-210 (1999) |
